activestash, which is where your states get put when you initialize a new simulation manager.
exitsyscall, it is removed from the active stash and placed in the
.move(), which takes
filter_func(optional, default is to move everything). For example, let's move everything that has a certain string in its output:
one_, you will be given the first state in the stash. If you prepend the name of a stash with
mp_, you will be given a mulpyplexed version of the stash.
run, and any other method that operates on a single stash of paths can take a
stashargument, specifying which stash to operate on.
LAZY_SOLVES, states are not checked for satisfiability unless absolutely necessary. When a state is found to be unsat in the presence of
LAZY_SOLVES, the state hierarchy is traversed to identify when, in its history, it initially became unsat. All states that are descendants of that point (which will also be unsat, since a state cannot become un-unsat) are pruned and put in this stash.
save_unconstrainedoption is provided to the SimulationManager constructor, states that are determined to be unconstrained (i.e., with the instruction pointer controlled by user data or some other source of symbolic data) are placed here.
save_unsatoption is provided to the SimulationManager constructor, states that are determined to be unsatisfiable (i.e., they have constraints that are contradictory, like the input having to be both "AAAA" and "BBBB" at the same time) are placed here.
errored. If, during execution, an error is raised, then the state will be wrapped in an
ErrorRecordobject, which contains the state and the error it raised, and then the record will be inserted into
errored. You can get at the state as it was at the beginning of the execution tick that caused the error with
record.state, you can see the error that was raised with
record.error, and you can launch a debug shell at the site of the error with
record.debug(). This is an invaluable debugging tool!
findargument, execution will run until a state is found that matches the find condition, which can be the address of an instruction to stop at, a list of addresses to stop at, or a function which takes a state and returns whether it meets some criteria. When any of the states in the active stash match the
findcondition, they are placed in the
foundstash, and execution terminates. You can then explore the found state, or decide to discard it and continue with the other ones. You can also specify an
avoidcondition in the same format as
find. When a state matches the avoid condition, it is put in the
avoidedstash, and execution continues. Finally, the
num_findargument controls the number of states that should be found before returning, with a default of 1. Of course, if you run out of states in the active stash before finding this many solutions, execution will stop anyway.
simgr.use_technique(tech), where tech is an instance of an ExplorationTechnique subclass. angr's built-in exploration techniques can be found under
deferredstash until it deadends or errors.
.explore()functionality, allowing you to search for and avoid addresses.
spinningstash and pulling them out again if we run out of otherwise viable states.
veritesting=Truein the SimulationManager constructor! Note that it frequenly doesn't play nice with other techniques due to the invasive way it implements static symbolic execution.