Public Member Functions | |
__init__ (self, solver=None, ctx=None, logFile=None) | |
__del__ (self) | |
__enter__ (self) | |
__exit__ (self, *exc_info) | |
set (self, *args, **keys) | |
push (self) | |
pop (self, num=1) | |
num_scopes (self) | |
reset (self) | |
assert_exprs (self, *args) | |
add (self, *args) | |
__iadd__ (self, fml) | |
append (self, *args) | |
insert (self, *args) | |
assert_and_track (self, a, p) | |
check (self, *assumptions) | |
model (self) | |
import_model_converter (self, other) | |
interrupt (self) | |
unsat_core (self) | |
consequences (self, assumptions, variables) | |
from_file (self, filename) | |
from_string (self, s) | |
cube (self, vars=None) | |
cube_vars (self) | |
root (self, t) | |
next (self, t) | |
explain_congruent (self, a, b) | |
solve_for1 (self, t) | |
solve_for (self, ts) | |
proof (self) | |
assertions (self) | |
units (self) | |
non_units (self) | |
trail_levels (self) | |
set_initial_value (self, var, value) | |
trail (self) | |
statistics (self) | |
reason_unknown (self) | |
help (self) | |
param_descrs (self) | |
__repr__ (self) | |
translate (self, target) | |
__copy__ (self) | |
__deepcopy__ (self, memo={}) | |
sexpr (self) | |
dimacs (self, include_names=True) | |
to_smt2 (self) | |
![]() | |
use_pp (self) | |
Data Fields | |
ctx = _get_ctx(ctx) | |
int | backtrack_level = 4000000000 |
solver = None | |
cube_vs = AstVector(None, self.ctx) | |
Additional Inherited Members | |
![]() | |
_repr_html_ (self) | |
Solver API provides methods for implementing the main SMT 2.0 commands: push, pop, check, get-model, etc.
__init__ | ( | self, | |
solver = None, | |||
ctx = None, | |||
logFile = None ) |
Definition at line 7011 of file z3py.py.
__del__ | ( | self | ) |
Definition at line 7024 of file z3py.py.
__copy__ | ( | self | ) |
__deepcopy__ | ( | self, | |
memo = {} ) |
__enter__ | ( | self | ) |
__exit__ | ( | self, | |
* | exc_info ) |
__iadd__ | ( | self, | |
fml ) |
__repr__ | ( | self | ) |
add | ( | self, | |
* | args ) |
Assert constraints into the solver. >>> x = Int('x') >>> s = Solver() >>> s.add(x > 0, x < 2) >>> s [x > 0, x < 2]
Definition at line 7143 of file z3py.py.
Referenced by __iadd__().
append | ( | self, | |
* | args ) |
Assert constraints into the solver. >>> x = Int('x') >>> s = Solver() >>> s.append(x > 0, x < 2) >>> s [x > 0, x < 2]
Definition at line 7158 of file z3py.py.
assert_and_track | ( | self, | |
a, | |||
p ) |
Assert constraint `a` and track it in the unsat core using the Boolean constant `p`. If `p` is a string, it will be automatically converted into a Boolean constant. >>> x = Int('x') >>> p3 = Bool('p3') >>> s = Solver() >>> s.set(unsat_core=True) >>> s.assert_and_track(x > 0, 'p1') >>> s.assert_and_track(x != 1, 'p2') >>> s.assert_and_track(x < 0, p3) >>> print(s.check()) unsat >>> c = s.unsat_core() >>> len(c) 2 >>> Bool('p1') in c True >>> Bool('p2') in c False >>> p3 in c True
Definition at line 7180 of file z3py.py.
assert_exprs | ( | self, | |
* | args ) |
Assert constraints into the solver. >>> x = Int('x') >>> s = Solver() >>> s.assert_exprs(x > 0, x < 2) >>> s [x > 0, x < 2]
Definition at line 7124 of file z3py.py.
assertions | ( | self | ) |
Return an AST vector containing all added constraints. >>> s = Solver() >>> s.assertions() [] >>> a = Int('a') >>> s.add(a > 0) >>> s.add(a < 10) >>> s.assertions() [a > 0, a < 10]
Definition at line 7410 of file z3py.py.
check | ( | self, | |
* | assumptions ) |
Check whether the assertions in the given solver plus the optional assumptions are consistent or not. >>> x = Int('x') >>> s = Solver() >>> s.check() sat >>> s.add(x > 0, x < 2) >>> s.check() sat >>> s.model().eval(x) 1 >>> s.add(x < 1) >>> s.check() unsat >>> s.reset() >>> s.add(2**x == 4) >>> s.check() unknown
Definition at line 7210 of file z3py.py.
consequences | ( | self, | |
assumptions, | |||
variables ) |
Determine fixed values for the variables based on the solver state and assumptions. >>> s = Solver() >>> a, b, c, d = Bools('a b c d') >>> s.add(Implies(a,b), Implies(b, c)) >>> s.consequences([a],[b,c,d]) (sat, [Implies(a, b), Implies(a, c)]) >>> s.consequences([Not(c),d],[a,b,c,d]) (sat, [Implies(d, d), Implies(Not(c), Not(c)), Implies(Not(c), Not(b)), Implies(Not(c), Not(a))])
Definition at line 7301 of file z3py.py.
cube | ( | self, | |
vars = None ) |
Get set of cubes The method takes an optional set of variables that restrict which variables may be used as a starting point for cubing. If vars is not None, then the first case split is based on a variable in this set.
Definition at line 7338 of file z3py.py.
cube_vars | ( | self | ) |
Access the set of variables that were touched by the most recently generated cube. This set of variables can be used as a starting point for additional cubes. The idea is that variables that appear in clauses that are reduced by the most recent cube are likely more useful to cube on.
Definition at line 7359 of file z3py.py.
dimacs | ( | self, | |
include_names = True ) |
Return a textual representation of the solver in DIMACS format.
Definition at line 7528 of file z3py.py.
explain_congruent | ( | self, | |
a, | |||
b ) |
Explain congruence of a and b relative to the current search state
Definition at line 7382 of file z3py.py.
from_file | ( | self, | |
filename ) |
Parse assertions from a file
Definition at line 7330 of file z3py.py.
from_string | ( | self, | |
s ) |
Parse assertions from a string
Definition at line 7334 of file z3py.py.
help | ( | self | ) |
Display a string describing all available options.
Definition at line 7485 of file z3py.py.
import_model_converter | ( | self, | |
other ) |
insert | ( | self, | |
* | args ) |
Assert constraints into the solver. >>> x = Int('x') >>> s = Solver() >>> s.insert(x > 0, x < 2) >>> s [x > 0, x < 2]
Definition at line 7169 of file z3py.py.
interrupt | ( | self | ) |
Interrupt the execution of the solver object. Remarks: This ensures that the interrupt applies only to the given solver object and it applies only if it is running.
Definition at line 7262 of file z3py.py.
model | ( | self | ) |
Return a model for the last `check()`. This function raises an exception if a model is not available (e.g., last `check()` returned unsat). >>> s = Solver() >>> a = Int('a') >>> s.add(a + 2 == 0) >>> s.check() sat >>> s.model() [a = -2]
Definition at line 7239 of file z3py.py.
next | ( | self, | |
t ) |
Retrieve congruence closure sibling of the term t relative to the current search state The function primarily works for SimpleSolver. Terms and variables that are eliminated during pre-processing are not visible to the congruence closure.
Definition at line 7374 of file z3py.py.
non_units | ( | self | ) |
Return an AST vector containing all atomic formulas in solver state that are not units.
Definition at line 7429 of file z3py.py.
num_scopes | ( | self | ) |
Return the current number of backtracking points. >>> s = Solver() >>> s.num_scopes() 0 >>> s.push() >>> s.num_scopes() 1 >>> s.push() >>> s.num_scopes() 2 >>> s.pop() >>> s.num_scopes() 1
Definition at line 7092 of file z3py.py.
param_descrs | ( | self | ) |
Return the parameter description set.
Definition at line 7489 of file z3py.py.
pop | ( | self, | |
num = 1 ) |
Backtrack \\c num backtracking points. >>> x = Int('x') >>> s = Solver() >>> s.add(x > 0) >>> s [x > 0] >>> s.push() >>> s.add(x < 1) >>> s [x > 0, x < 1] >>> s.check() unsat >>> s.pop() >>> s.check() sat >>> s [x > 0]
Definition at line 7070 of file z3py.py.
Referenced by __exit__().
proof | ( | self | ) |
Return a proof for the last `check()`. Proof construction must be enabled.
Definition at line 7406 of file z3py.py.
push | ( | self | ) |
Create a backtracking point. >>> x = Int('x') >>> s = Solver() >>> s.add(x > 0) >>> s [x > 0] >>> s.push() >>> s.add(x < 1) >>> s [x > 0, x < 1] >>> s.check() unsat >>> s.pop() >>> s.check() sat >>> s [x > 0]
Definition at line 7048 of file z3py.py.
Referenced by __enter__().
reason_unknown | ( | self | ) |
Return a string describing why the last `check()` returned `unknown`. >>> x = Int('x') >>> s = SimpleSolver() >>> s.add(2**x == 4) >>> s.check() unknown >>> s.reason_unknown() '(incomplete (theory arithmetic))'
Definition at line 7472 of file z3py.py.
reset | ( | self | ) |
Remove all asserted constraints and backtracking points created using `push()`. >>> x = Int('x') >>> s = Solver() >>> s.add(x > 0) >>> s [x > 0] >>> s.reset() >>> s []
Definition at line 7110 of file z3py.py.
root | ( | self, | |
t ) |
Retrieve congruence closure root of the term t relative to the current search state The function primarily works for SimpleSolver. Terms and variables that are eliminated during pre-processing are not visible to the congruence closure.
Definition at line 7366 of file z3py.py.
set | ( | self, | |
* | args, | ||
** | keys ) |
Set a configuration option. The method `help()` return a string containing all available options. >>> s = Solver() >>> # The option MBQI can be set using three different approaches. >>> s.set(mbqi=True) >>> s.set('MBQI', True) >>> s.set(':mbqi', True)
Definition at line 7035 of file z3py.py.
set_initial_value | ( | self, | |
var, | |||
value ) |
initialize the solver's state by setting the initial value of var to value
Definition at line 7442 of file z3py.py.
sexpr | ( | self | ) |
Return a formatted string (in Lisp-like format) with all added constraints. We say the string is in s-expression format. >>> x = Int('x') >>> s = Solver() >>> s.add(x > 0) >>> s.add(x < 2) >>> r = s.sexpr()
Definition at line 7516 of file z3py.py.
solve_for | ( | self, | |
ts ) |
Retrieve a solution for t relative to linear equations maintained in the current state.
Definition at line 7394 of file z3py.py.
solve_for1 | ( | self, | |
t ) |
Retrieve a solution for t relative to linear equations maintained in the current state. The function primarily works for SimpleSolver and when there is a solution using linear arithmetic.
Definition at line 7388 of file z3py.py.
statistics | ( | self | ) |
Return statistics for the last `check()`. >>> s = SimpleSolver() >>> x = Int('x') >>> s.add(x > 0) >>> s.check() sat >>> st = s.statistics() >>> st.get_key_value('final checks') 1 >>> len(st) > 0 True >>> st[0] != 0 True
Definition at line 7454 of file z3py.py.
to_smt2 | ( | self | ) |
return SMTLIB2 formatted benchmark for solver's assertions
Definition at line 7532 of file z3py.py.
trail | ( | self | ) |
Return trail of the solver state after a check() call.
Definition at line 7449 of file z3py.py.
trail_levels | ( | self | ) |
Return trail and decision levels of the solver state after a check() call.
Definition at line 7434 of file z3py.py.
translate | ( | self, | |
target ) |
Translate `self` to the context `target`. That is, return a copy of `self` in the context `target`. >>> c1 = Context() >>> c2 = Context() >>> s1 = Solver(ctx=c1) >>> s2 = s1.translate(c2)
Definition at line 7497 of file z3py.py.
units | ( | self | ) |
Return an AST vector containing all currently inferred units.
Definition at line 7424 of file z3py.py.
unsat_core | ( | self | ) |
Return a subset (as an AST vector) of the assumptions provided to the last check(). These are the assumptions Z3 used in the unsatisfiability proof. Assumptions are available in Z3. They are used to extract unsatisfiable cores. They may be also used to "retract" assumptions. Note that, assumptions are not really "soft constraints", but they can be used to implement them. >>> p1, p2, p3 = Bools('p1 p2 p3') >>> x, y = Ints('x y') >>> s = Solver() >>> s.add(Implies(p1, x > 0)) >>> s.add(Implies(p2, y > x)) >>> s.add(Implies(p2, y < 1)) >>> s.add(Implies(p3, y > -3)) >>> s.check(p1, p2, p3) unsat >>> core = s.unsat_core() >>> len(core) 2 >>> p1 in core True >>> p2 in core True >>> p3 in core False >>> # "Retracting" p2 >>> s.check(p1, p3) sat
Definition at line 7269 of file z3py.py.
ctx = _get_ctx(ctx) |
Definition at line 7013 of file z3py.py.
Referenced by __del__(), assert_and_track(), assert_exprs(), check(), model(), num_scopes(), pop(), push(), reset(), and set().
solver = None |
Definition at line 7015 of file z3py.py.
Referenced by __del__(), assert_and_track(), assert_exprs(), check(), model(), num_scopes(), pop(), push(), reset(), and set().