Z3 C++ namespace.
More...
|
void | set_param (char const *param, char const *value) |
|
void | set_param (char const *param, bool value) |
|
void | set_param (char const *param, int value) |
|
void | reset_params () |
|
std::ostream & | operator<< (std::ostream &out, exception const &e) |
|
check_result | to_check_result (Z3_lbool l) |
|
void | check_context (object const &a, object const &b) |
|
std::ostream & | operator<< (std::ostream &out, symbol const &s) |
|
std::ostream & | operator<< (std::ostream &out, param_descrs const &d) |
|
std::ostream & | operator<< (std::ostream &out, params const &p) |
|
std::ostream & | operator<< (std::ostream &out, ast const &n) |
|
bool | eq (ast const &a, ast const &b) |
|
expr | select (expr const &a, expr const &i) |
| forward declarations More...
|
|
expr | select (expr const &a, expr_vector const &i) |
|
expr | implies (expr const &a, expr const &b) |
|
expr | implies (expr const &a, bool b) |
|
expr | implies (bool a, expr const &b) |
|
expr | pw (expr const &a, expr const &b) |
|
expr | pw (expr const &a, int b) |
|
expr | pw (int a, expr const &b) |
|
expr | mod (expr const &a, expr const &b) |
|
expr | mod (expr const &a, int b) |
|
expr | mod (int a, expr const &b) |
|
expr | operator% (expr const &a, expr const &b) |
|
expr | operator% (expr const &a, int b) |
|
expr | operator% (int a, expr const &b) |
|
expr | rem (expr const &a, expr const &b) |
|
expr | rem (expr const &a, int b) |
|
expr | rem (int a, expr const &b) |
|
expr | operator! (expr const &a) |
|
expr | is_int (expr const &e) |
|
expr | operator&& (expr const &a, expr const &b) |
|
expr | operator&& (expr const &a, bool b) |
|
expr | operator&& (bool a, expr const &b) |
|
expr | operator|| (expr const &a, expr const &b) |
|
expr | operator|| (expr const &a, bool b) |
|
expr | operator|| (bool a, expr const &b) |
|
expr | operator== (expr const &a, expr const &b) |
|
expr | operator== (expr const &a, int b) |
|
expr | operator== (int a, expr const &b) |
|
expr | operator!= (expr const &a, expr const &b) |
|
expr | operator!= (expr const &a, int b) |
|
expr | operator!= (int a, expr const &b) |
|
expr | operator+ (expr const &a, expr const &b) |
|
expr | operator+ (expr const &a, int b) |
|
expr | operator+ (int a, expr const &b) |
|
expr | operator* (expr const &a, expr const &b) |
|
expr | operator* (expr const &a, int b) |
|
expr | operator* (int a, expr const &b) |
|
expr | operator>= (expr const &a, expr const &b) |
|
expr | operator/ (expr const &a, expr const &b) |
|
expr | operator/ (expr const &a, int b) |
|
expr | operator/ (int a, expr const &b) |
|
expr | operator- (expr const &a) |
|
expr | operator- (expr const &a, expr const &b) |
|
expr | operator- (expr const &a, int b) |
|
expr | operator- (int a, expr const &b) |
|
expr | operator<= (expr const &a, expr const &b) |
|
expr | operator<= (expr const &a, int b) |
|
expr | operator<= (int a, expr const &b) |
|
expr | operator>= (expr const &a, int b) |
|
expr | operator>= (int a, expr const &b) |
|
expr | operator< (expr const &a, expr const &b) |
|
expr | operator< (expr const &a, int b) |
|
expr | operator< (int a, expr const &b) |
|
expr | operator> (expr const &a, expr const &b) |
|
expr | operator> (expr const &a, int b) |
|
expr | operator> (int a, expr const &b) |
|
expr | operator& (expr const &a, expr const &b) |
|
expr | operator& (expr const &a, int b) |
|
expr | operator& (int a, expr const &b) |
|
expr | operator^ (expr const &a, expr const &b) |
|
expr | operator^ (expr const &a, int b) |
|
expr | operator^ (int a, expr const &b) |
|
expr | operator| (expr const &a, expr const &b) |
|
expr | operator| (expr const &a, int b) |
|
expr | operator| (int a, expr const &b) |
|
expr | nand (expr const &a, expr const &b) |
|
expr | nor (expr const &a, expr const &b) |
|
expr | xnor (expr const &a, expr const &b) |
|
expr | min (expr const &a, expr const &b) |
|
expr | max (expr const &a, expr const &b) |
|
expr | abs (expr const &a) |
|
expr | sqrt (expr const &a, expr const &rm) |
|
expr | operator~ (expr const &a) |
|
expr | fma (expr const &a, expr const &b, expr const &c, expr const &rm) |
|
expr | ite (expr const &c, expr const &t, expr const &e) |
| Create the if-then-else expression ite(c, t, e) More...
|
|
expr | to_expr (context &c, Z3_ast a) |
| Wraps a Z3_ast as an expr object. It also checks for errors. This function allows the user to use the whole C API with the C++ layer defined in this file. More...
|
|
sort | to_sort (context &c, Z3_sort s) |
|
func_decl | to_func_decl (context &c, Z3_func_decl f) |
|
expr | sle (expr const &a, expr const &b) |
| signed less than or equal to operator for bitvectors. More...
|
|
expr | sle (expr const &a, int b) |
|
expr | sle (int a, expr const &b) |
|
expr | slt (expr const &a, expr const &b) |
| signed less than operator for bitvectors. More...
|
|
expr | slt (expr const &a, int b) |
|
expr | slt (int a, expr const &b) |
|
expr | ule (expr const &a, expr const &b) |
| unsigned less than or equal to operator for bitvectors. More...
|
|
expr | ule (expr const &a, int b) |
|
expr | ule (int a, expr const &b) |
|
expr | ult (expr const &a, expr const &b) |
| unsigned less than operator for bitvectors. More...
|
|
expr | ult (expr const &a, int b) |
|
expr | ult (int a, expr const &b) |
|
expr | uge (expr const &a, expr const &b) |
| unsigned greater than or equal to operator for bitvectors. More...
|
|
expr | uge (expr const &a, int b) |
|
expr | uge (int a, expr const &b) |
|
expr | ugt (expr const &a, expr const &b) |
| unsigned greater than operator for bitvectors. More...
|
|
expr | ugt (expr const &a, int b) |
|
expr | ugt (int a, expr const &b) |
|
expr | udiv (expr const &a, expr const &b) |
| unsigned division operator for bitvectors. More...
|
|
expr | udiv (expr const &a, int b) |
|
expr | udiv (int a, expr const &b) |
|
expr | srem (expr const &a, expr const &b) |
| signed remainder operator for bitvectors More...
|
|
expr | srem (expr const &a, int b) |
|
expr | srem (int a, expr const &b) |
|
expr | smod (expr const &a, expr const &b) |
| signed modulus operator for bitvectors More...
|
|
expr | smod (expr const &a, int b) |
|
expr | smod (int a, expr const &b) |
|
expr | urem (expr const &a, expr const &b) |
| unsigned reminder operator for bitvectors More...
|
|
expr | urem (expr const &a, int b) |
|
expr | urem (int a, expr const &b) |
|
expr | shl (expr const &a, expr const &b) |
| shift left operator for bitvectors More...
|
|
expr | shl (expr const &a, int b) |
|
expr | shl (int a, expr const &b) |
|
expr | lshr (expr const &a, expr const &b) |
| logic shift right operator for bitvectors More...
|
|
expr | lshr (expr const &a, int b) |
|
expr | lshr (int a, expr const &b) |
|
expr | ashr (expr const &a, expr const &b) |
| arithmetic shift right operator for bitvectors More...
|
|
expr | ashr (expr const &a, int b) |
|
expr | ashr (int a, expr const &b) |
|
expr | zext (expr const &a, unsigned i) |
| Extend the given bit-vector with zeros to the (unsigned) equivalent bitvector of size m+i, where m is the size of the given bit-vector. More...
|
|
expr | bv2int (expr const &a, bool is_signed) |
| bit-vector and integer conversions. More...
|
|
expr | int2bv (unsigned n, expr const &a) |
|
expr | bvadd_no_overflow (expr const &a, expr const &b, bool is_signed) |
| bit-vector overflow/underflow checks More...
|
|
expr | bvadd_no_underflow (expr const &a, expr const &b) |
|
expr | bvsub_no_overflow (expr const &a, expr const &b) |
|
expr | bvsub_no_underflow (expr const &a, expr const &b, bool is_signed) |
|
expr | bvsdiv_no_overflow (expr const &a, expr const &b) |
|
expr | bvneg_no_overflow (expr const &a) |
|
expr | bvmul_no_overflow (expr const &a, expr const &b, bool is_signed) |
|
expr | bvmul_no_underflow (expr const &a, expr const &b) |
|
expr | sext (expr const &a, unsigned i) |
| Sign-extend of the given bit-vector to the (signed) equivalent bitvector of size m+i, where m is the size of the given bit-vector. More...
|
|
func_decl | linear_order (sort const &a, unsigned index) |
|
func_decl | partial_order (sort const &a, unsigned index) |
|
func_decl | piecewise_linear_order (sort const &a, unsigned index) |
|
func_decl | tree_order (sort const &a, unsigned index) |
|
expr | forall (expr const &x, expr const &b) |
|
expr | forall (expr const &x1, expr const &x2, expr const &b) |
|
expr | forall (expr const &x1, expr const &x2, expr const &x3, expr const &b) |
|
expr | forall (expr const &x1, expr const &x2, expr const &x3, expr const &x4, expr const &b) |
|
expr | forall (expr_vector const &xs, expr const &b) |
|
expr | exists (expr const &x, expr const &b) |
|
expr | exists (expr const &x1, expr const &x2, expr const &b) |
|
expr | exists (expr const &x1, expr const &x2, expr const &x3, expr const &b) |
|
expr | exists (expr const &x1, expr const &x2, expr const &x3, expr const &x4, expr const &b) |
|
expr | exists (expr_vector const &xs, expr const &b) |
|
expr | lambda (expr const &x, expr const &b) |
|
expr | lambda (expr const &x1, expr const &x2, expr const &b) |
|
expr | lambda (expr const &x1, expr const &x2, expr const &x3, expr const &b) |
|
expr | lambda (expr const &x1, expr const &x2, expr const &x3, expr const &x4, expr const &b) |
|
expr | lambda (expr_vector const &xs, expr const &b) |
|
expr | pble (expr_vector const &es, int const *coeffs, int bound) |
|
expr | pbge (expr_vector const &es, int const *coeffs, int bound) |
|
expr | pbeq (expr_vector const &es, int const *coeffs, int bound) |
|
expr | atmost (expr_vector const &es, unsigned bound) |
|
expr | atleast (expr_vector const &es, unsigned bound) |
|
expr | sum (expr_vector const &args) |
|
expr | distinct (expr_vector const &args) |
|
expr | concat (expr const &a, expr const &b) |
|
expr | concat (expr_vector const &args) |
|
expr | mk_or (expr_vector const &args) |
|
expr | mk_and (expr_vector const &args) |
|
std::ostream & | operator<< (std::ostream &out, model const &m) |
|
std::ostream & | operator<< (std::ostream &out, stats const &s) |
|
std::ostream & | operator<< (std::ostream &out, check_result r) |
|
std::ostream & | operator<< (std::ostream &out, solver const &s) |
|
std::ostream & | operator<< (std::ostream &out, goal const &g) |
|
std::ostream & | operator<< (std::ostream &out, apply_result const &r) |
|
tactic | operator& (tactic const &t1, tactic const &t2) |
|
tactic | operator| (tactic const &t1, tactic const &t2) |
|
tactic | repeat (tactic const &t, unsigned max=UINT_MAX) |
|
tactic | with (tactic const &t, params const &p) |
|
tactic | try_for (tactic const &t, unsigned ms) |
|
tactic | par_or (unsigned n, tactic const *tactics) |
|
tactic | par_and_then (tactic const &t1, tactic const &t2) |
|
probe | operator<= (probe const &p1, probe const &p2) |
|
probe | operator<= (probe const &p1, double p2) |
|
probe | operator<= (double p1, probe const &p2) |
|
probe | operator>= (probe const &p1, probe const &p2) |
|
probe | operator>= (probe const &p1, double p2) |
|
probe | operator>= (double p1, probe const &p2) |
|
probe | operator< (probe const &p1, probe const &p2) |
|
probe | operator< (probe const &p1, double p2) |
|
probe | operator< (double p1, probe const &p2) |
|
probe | operator> (probe const &p1, probe const &p2) |
|
probe | operator> (probe const &p1, double p2) |
|
probe | operator> (double p1, probe const &p2) |
|
probe | operator== (probe const &p1, probe const &p2) |
|
probe | operator== (probe const &p1, double p2) |
|
probe | operator== (double p1, probe const &p2) |
|
probe | operator&& (probe const &p1, probe const &p2) |
|
probe | operator|| (probe const &p1, probe const &p2) |
|
probe | operator! (probe const &p) |
|
std::ostream & | operator<< (std::ostream &out, optimize const &s) |
|
std::ostream & | operator<< (std::ostream &out, fixedpoint const &f) |
|
tactic | fail_if (probe const &p) |
|
tactic | when (probe const &p, tactic const &t) |
|
tactic | cond (probe const &p, tactic const &t1, tactic const &t2) |
|
expr | to_real (expr const &a) |
|
func_decl | function (symbol const &name, unsigned arity, sort const *domain, sort const &range) |
|
func_decl | function (char const *name, unsigned arity, sort const *domain, sort const &range) |
|
func_decl | function (char const *name, sort const &domain, sort const &range) |
|
func_decl | function (char const *name, sort const &d1, sort const &d2, sort const &range) |
|
func_decl | function (char const *name, sort const &d1, sort const &d2, sort const &d3, sort const &range) |
|
func_decl | function (char const *name, sort const &d1, sort const &d2, sort const &d3, sort const &d4, sort const &range) |
|
func_decl | function (char const *name, sort const &d1, sort const &d2, sort const &d3, sort const &d4, sort const &d5, sort const &range) |
|
func_decl | function (char const *name, sort_vector const &domain, sort const &range) |
|
func_decl | function (std::string const &name, sort_vector const &domain, sort const &range) |
|
func_decl | recfun (symbol const &name, unsigned arity, sort const *domain, sort const &range) |
|
func_decl | recfun (char const *name, unsigned arity, sort const *domain, sort const &range) |
|
func_decl | recfun (char const *name, sort const &d1, sort const &range) |
|
func_decl | recfun (char const *name, sort const &d1, sort const &d2, sort const &range) |
|
expr | select (expr const &a, int i) |
|
expr | store (expr const &a, expr const &i, expr const &v) |
|
expr | store (expr const &a, int i, expr const &v) |
|
expr | store (expr const &a, expr i, int v) |
|
expr | store (expr const &a, int i, int v) |
|
expr | store (expr const &a, expr_vector const &i, expr const &v) |
|
expr | as_array (func_decl &f) |
|
expr | const_array (sort const &d, expr const &v) |
|
expr | empty_set (sort const &s) |
|
expr | full_set (sort const &s) |
|
expr | set_add (expr const &s, expr const &e) |
|
expr | set_del (expr const &s, expr const &e) |
|
expr | set_union (expr const &a, expr const &b) |
|
expr | set_intersect (expr const &a, expr const &b) |
|
expr | set_difference (expr const &a, expr const &b) |
|
expr | set_complement (expr const &a) |
|
expr | set_member (expr const &s, expr const &e) |
|
expr | set_subset (expr const &a, expr const &b) |
|
expr | empty (sort const &s) |
|
expr | suffixof (expr const &a, expr const &b) |
|
expr | prefixof (expr const &a, expr const &b) |
|
expr | indexof (expr const &s, expr const &substr, expr const &offset) |
|
expr | last_indexof (expr const &s, expr const &substr) |
|
expr | to_re (expr const &s) |
|
expr | in_re (expr const &s, expr const &re) |
|
expr | plus (expr const &re) |
|
expr | option (expr const &re) |
|
expr | star (expr const &re) |
|
expr | re_empty (sort const &s) |
|
expr | re_full (sort const &s) |
|
expr | re_intersect (expr_vector const &args) |
|
expr | re_complement (expr const &a) |
|
expr | range (expr const &lo, expr const &hi) |
|
◆ ast_vector
◆ expr_vector
◆ func_decl_vector
◆ sort_vector
◆ check_result
Enumerator |
---|
unsat | |
sat | |
unknown | |
Definition at line 132 of file z3++.h.
◆ rounding_mode
Enumerator |
---|
RNA | |
RNE | |
RTP | |
RTN | |
RTZ | |
Definition at line 136 of file z3++.h.
◆ abs()
Definition at line 1722 of file z3++.h.
1725 expr zero = a.ctx().int_val(0);
1728 else if (a.is_real()) {
1729 expr zero = a.ctx().real_val(0);
1736 return expr(a.ctx(), r);
◆ as_array()
Definition at line 3350 of file z3++.h.
3353 return expr(f.ctx(), r);
◆ ashr() [1/3]
arithmetic shift right operator for bitvectors
Definition at line 1876 of file z3++.h.
Referenced by ashr().
◆ ashr() [2/3]
Definition at line 1877 of file z3++.h.
1877 {
return ashr(a, a.ctx().num_val(b, a.get_sort())); }
◆ ashr() [3/3]
Definition at line 1878 of file z3++.h.
1878 {
return ashr(b.ctx().num_val(a, b.get_sort()), b); }
◆ atleast()
Definition at line 2087 of file z3++.h.
2088 assert(es.size() > 0);
2089 context& ctx = es[0].ctx();
2090 array<Z3_ast> _es(es);
2091 Z3_ast r =
Z3_mk_atleast(ctx, _es.size(), _es.ptr(), bound);
2093 return expr(ctx, r);
◆ atmost()
Definition at line 2079 of file z3++.h.
2080 assert(es.size() > 0);
2081 context& ctx = es[0].ctx();
2082 array<Z3_ast> _es(es);
2083 Z3_ast r =
Z3_mk_atmost(ctx, _es.size(), _es.ptr(), bound);
2085 return expr(ctx, r);
◆ bv2int()
expr z3::bv2int |
( |
expr const & |
a, |
|
|
bool |
is_signed |
|
) |
| |
|
inline |
bit-vector and integer conversions.
Definition at line 1888 of file z3++.h.
1888 { Z3_ast r =
Z3_mk_bv2int(a.ctx(), a, is_signed); a.check_error();
return expr(a.ctx(), r); }
◆ bvadd_no_overflow()
expr z3::bvadd_no_overflow |
( |
expr const & |
a, |
|
|
expr const & |
b, |
|
|
bool |
is_signed |
|
) |
| |
|
inline |
bit-vector overflow/underflow checks
Definition at line 1894 of file z3++.h.
◆ bvadd_no_underflow()
expr z3::bvadd_no_underflow |
( |
expr const & |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
◆ bvmul_no_overflow()
expr z3::bvmul_no_overflow |
( |
expr const & |
a, |
|
|
expr const & |
b, |
|
|
bool |
is_signed |
|
) |
| |
|
inline |
◆ bvmul_no_underflow()
expr z3::bvmul_no_underflow |
( |
expr const & |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
◆ bvneg_no_overflow()
expr z3::bvneg_no_overflow |
( |
expr const & |
a | ) |
|
|
inline |
◆ bvsdiv_no_overflow()
expr z3::bvsdiv_no_overflow |
( |
expr const & |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
◆ bvsub_no_overflow()
expr z3::bvsub_no_overflow |
( |
expr const & |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
◆ bvsub_no_underflow()
expr z3::bvsub_no_underflow |
( |
expr const & |
a, |
|
|
expr const & |
b, |
|
|
bool |
is_signed |
|
) |
| |
|
inline |
◆ check_context()
void z3::check_context |
( |
object const & |
a, |
|
|
object const & |
b |
|
) |
| |
|
inline |
Definition at line 413 of file z3++.h.
413 { (void)a; (void)b; assert(a.m_ctx == b.m_ctx); }
Referenced by bvadd_no_overflow(), bvadd_no_underflow(), bvmul_no_overflow(), bvmul_no_underflow(), bvsdiv_no_overflow(), bvsub_no_overflow(), bvsub_no_underflow(), concat(), cond(), exists(), fma(), forall(), context::function(), indexof(), ite(), lambda(), last_indexof(), max(), min(), nand(), nor(), operator!=(), operator&(), operator&&(), operator*(), operator+(), operator-(), operator/(), operator<(), operator<=(), operator==(), operator>(), operator>=(), operator^(), operator|(), operator||(), par_and_then(), prefixof(), range(), context::recdef(), context::recfun(), select(), set_intersect(), set_union(), sqrt(), store(), suffixof(), when(), and xnor().
◆ concat() [1/2]
Definition at line 2113 of file z3++.h.
2117 Z3_ast _args[2] = { a, b };
2121 Z3_ast _args[2] = { a, b };
2127 a.ctx().check_error();
2128 return expr(a.ctx(), r);
Referenced by operator+().
◆ concat() [2/2]
Definition at line 2131 of file z3++.h.
2133 assert(args.size() > 0);
2134 if (args.size() == 1) {
2137 context& ctx = args[0].ctx();
2138 array<Z3_ast> _args(args);
2146 r = _args[args.size()-1];
2147 for (
unsigned i = args.size()-1; i > 0; ) {
2154 return expr(ctx, r);
◆ cond()
Definition at line 2955 of file z3++.h.
2959 return tactic(t1.ctx(), r);
◆ const_array()
◆ distinct()
Definition at line 2104 of file z3++.h.
2105 assert(args.size() > 0);
2106 context& ctx = args[0].ctx();
2107 array<Z3_ast> _args(args);
2110 return expr(ctx, r);
◆ empty()
Definition at line 3423 of file z3++.h.
3426 return expr(s.ctx(), r);
◆ empty_set()
◆ eq()
bool z3::eq |
( |
ast const & |
a, |
|
|
ast const & |
b |
|
) |
| |
|
inline |
◆ exists() [1/5]
Definition at line 2006 of file z3++.h.
2008 Z3_app vars[] = {(Z3_app) x};
2009 Z3_ast r =
Z3_mk_exists_const(b.ctx(), 0, 1, vars, 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ exists() [2/5]
Definition at line 2011 of file z3++.h.
2013 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};
2014 Z3_ast r =
Z3_mk_exists_const(b.ctx(), 0, 2, vars, 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ exists() [3/5]
Definition at line 2016 of file z3++.h.
2018 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };
2019 Z3_ast r =
Z3_mk_exists_const(b.ctx(), 0, 3, vars, 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ exists() [4/5]
Definition at line 2021 of file z3++.h.
2023 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };
2024 Z3_ast r =
Z3_mk_exists_const(b.ctx(), 0, 4, vars, 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ exists() [5/5]
Definition at line 2026 of file z3++.h.
2027 array<Z3_app> vars(xs);
2028 Z3_ast r =
Z3_mk_exists_const(b.ctx(), 0, vars.size(), vars.ptr(), 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ fail_if()
Definition at line 2944 of file z3++.h.
2947 return tactic(p.ctx(), r);
◆ fma()
Definition at line 1747 of file z3++.h.
1749 assert(a.is_fpa() && b.is_fpa() && c.is_fpa());
1752 return expr(a.ctx(), r);
◆ forall() [1/5]
Definition at line 1982 of file z3++.h.
1984 Z3_app vars[] = {(Z3_app) x};
1985 Z3_ast r =
Z3_mk_forall_const(b.ctx(), 0, 1, vars, 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ forall() [2/5]
Definition at line 1987 of file z3++.h.
1989 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};
1990 Z3_ast r =
Z3_mk_forall_const(b.ctx(), 0, 2, vars, 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ forall() [3/5]
Definition at line 1992 of file z3++.h.
1994 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };
1995 Z3_ast r =
Z3_mk_forall_const(b.ctx(), 0, 3, vars, 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ forall() [4/5]
Definition at line 1997 of file z3++.h.
1999 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };
2000 Z3_ast r =
Z3_mk_forall_const(b.ctx(), 0, 4, vars, 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ forall() [5/5]
Definition at line 2002 of file z3++.h.
2003 array<Z3_app> vars(xs);
2004 Z3_ast r =
Z3_mk_forall_const(b.ctx(), 0, vars.size(), vars.ptr(), 0, 0, b); b.check_error();
return expr(b.ctx(), r);
◆ full_set()
◆ function() [1/9]
◆ function() [2/9]
◆ function() [3/9]
◆ function() [4/9]
◆ function() [5/9]
func_decl z3::function |
( |
char const * |
name, |
|
|
sort const & |
domain, |
|
|
sort const & |
range |
|
) |
| |
|
inline |
◆ function() [6/9]
◆ function() [7/9]
func_decl z3::function |
( |
char const * |
name, |
|
|
unsigned |
arity, |
|
|
sort const * |
domain, |
|
|
sort const & |
range |
|
) |
| |
|
inline |
◆ function() [8/9]
◆ function() [9/9]
◆ implies() [1/3]
expr z3::implies |
( |
bool |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1382 of file z3++.h.
1382 {
return implies(b.ctx().bool_val(a), b); }
◆ implies() [2/3]
expr z3::implies |
( |
expr const & |
a, |
|
|
bool |
b |
|
) |
| |
|
inline |
Definition at line 1381 of file z3++.h.
1381 {
return implies(a, a.ctx().bool_val(b)); }
◆ implies() [3/3]
Definition at line 1377 of file z3++.h.
1378 assert(a.is_bool() && b.is_bool());
Referenced by implies().
◆ in_re()
◆ indexof()
Definition at line 3440 of file z3++.h.
3444 return expr(s.ctx(), r);
◆ int2bv()
expr z3::int2bv |
( |
unsigned |
n, |
|
|
expr const & |
a |
|
) |
| |
|
inline |
Definition at line 1889 of file z3++.h.
1889 { Z3_ast r =
Z3_mk_int2bv(a.ctx(), n, a); a.check_error();
return expr(a.ctx(), r); }
◆ is_int()
◆ ite()
Create the if-then-else expression ite(c, t, e)
- Precondition
- c.is_bool()
Definition at line 1761 of file z3++.h.
1763 assert(c.is_bool());
1766 return expr(c.ctx(), r);
◆ lambda() [1/5]
Definition at line 2030 of file z3++.h.
2032 Z3_app vars[] = {(Z3_app) x};
2033 Z3_ast r =
Z3_mk_lambda_const(b.ctx(), 1, vars, b); b.check_error();
return expr(b.ctx(), r);
◆ lambda() [2/5]
Definition at line 2035 of file z3++.h.
2037 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};
2038 Z3_ast r =
Z3_mk_lambda_const(b.ctx(), 2, vars, b); b.check_error();
return expr(b.ctx(), r);
◆ lambda() [3/5]
Definition at line 2040 of file z3++.h.
2042 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };
2043 Z3_ast r =
Z3_mk_lambda_const(b.ctx(), 3, vars, b); b.check_error();
return expr(b.ctx(), r);
◆ lambda() [4/5]
Definition at line 2045 of file z3++.h.
2047 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };
2048 Z3_ast r =
Z3_mk_lambda_const(b.ctx(), 4, vars, b); b.check_error();
return expr(b.ctx(), r);
◆ lambda() [5/5]
Definition at line 2050 of file z3++.h.
2051 array<Z3_app> vars(xs);
2052 Z3_ast r =
Z3_mk_lambda_const(b.ctx(), vars.size(), vars.ptr(), b); b.check_error();
return expr(b.ctx(), r);
◆ last_indexof()
expr z3::last_indexof |
( |
expr const & |
s, |
|
|
expr const & |
substr |
|
) |
| |
|
inline |
Definition at line 3446 of file z3++.h.
3450 return expr(s.ctx(), r);
◆ linear_order()
◆ lshr() [1/3]
logic shift right operator for bitvectors
Definition at line 1869 of file z3++.h.
Referenced by lshr().
◆ lshr() [2/3]
Definition at line 1870 of file z3++.h.
1870 {
return lshr(a, a.ctx().num_val(b, a.get_sort())); }
◆ lshr() [3/3]
Definition at line 1871 of file z3++.h.
1871 {
return lshr(b.ctx().num_val(a, b.get_sort()), b); }
◆ max()
◆ min()
Definition at line 1692 of file z3++.h.
1698 else if (a.is_bv()) {
1705 return expr(a.ctx(), r);
◆ mk_and()
Definition at line 2163 of file z3++.h.
2164 array<Z3_ast> _args(args);
2165 Z3_ast r =
Z3_mk_and(args.ctx(), _args.size(), _args.ptr());
2167 return expr(args.ctx(), r);
◆ mk_or()
Definition at line 2157 of file z3++.h.
2158 array<Z3_ast> _args(args);
2159 Z3_ast r =
Z3_mk_or(args.ctx(), _args.size(), _args.ptr());
2161 return expr(args.ctx(), r);
◆ mod() [1/3]
◆ mod() [2/3]
Definition at line 1397 of file z3++.h.
1397 {
return mod(a, a.ctx().num_val(b, a.get_sort())); }
◆ mod() [3/3]
Definition at line 1398 of file z3++.h.
1398 {
return mod(b.ctx().num_val(a, b.get_sort()), b); }
◆ nand()
◆ nor()
◆ operator!() [1/2]
◆ operator!() [2/2]
Definition at line 2798 of file z3++.h.
2799 Z3_probe r =
Z3_probe_not(p.ctx(), p); p.check_error();
return probe(p.ctx(), r);
◆ operator!=() [1/3]
Definition at line 1463 of file z3++.h.
1465 Z3_ast args[2] = { a, b };
1468 return expr(a.ctx(), r);
◆ operator!=() [2/3]
Definition at line 1470 of file z3++.h.
1470 { assert(a.is_arith() || a.is_bv() || a.is_fpa());
return a != a.ctx().num_val(b, a.get_sort()); }
◆ operator!=() [3/3]
Definition at line 1471 of file z3++.h.
1471 { assert(b.is_arith() || b.is_bv() || b.is_fpa());
return b.ctx().num_val(a, b.get_sort()) != b; }
◆ operator%() [1/3]
Definition at line 1400 of file z3++.h.
1400 {
return mod(a, b); }
◆ operator%() [2/3]
expr z3::operator% |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1401 of file z3++.h.
1401 {
return mod(a, b); }
◆ operator%() [3/3]
expr z3::operator% |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1402 of file z3++.h.
1402 {
return mod(a, b); }
◆ operator&() [1/4]
◆ operator&() [2/4]
expr z3::operator& |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1678 of file z3++.h.
1678 {
return a & a.ctx().num_val(b, a.get_sort()); }
◆ operator&() [3/4]
expr z3::operator& |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1679 of file z3++.h.
1679 {
return b.ctx().num_val(a, b.get_sort()) & b; }
◆ operator&() [4/4]
Definition at line 2679 of file z3++.h.
2683 return tactic(t1.ctx(), r);
◆ operator&&() [1/4]
expr z3::operator&& |
( |
bool |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
- Precondition
- b.is_bool()
Definition at line 1439 of file z3++.h.
1439 {
return b.ctx().bool_val(a) && b; }
◆ operator&&() [2/4]
expr z3::operator&& |
( |
expr const & |
a, |
|
|
bool |
b |
|
) |
| |
|
inline |
- Precondition
- a.is_bool()
Definition at line 1438 of file z3++.h.
1438 {
return a && a.ctx().bool_val(b); }
◆ operator&&() [3/4]
- Precondition
- a.is_bool()
-
b.is_bool()
Definition at line 1429 of file z3++.h.
1431 assert(a.is_bool() && b.is_bool());
1432 Z3_ast args[2] = { a, b };
1435 return expr(a.ctx(), r);
◆ operator&&() [4/4]
◆ operator*() [1/3]
Definition at line 1503 of file z3++.h.
1506 if (a.is_arith() && b.is_arith()) {
1507 Z3_ast args[2] = { a, b };
1510 else if (a.is_bv() && b.is_bv()) {
1513 else if (a.is_fpa() && b.is_fpa()) {
1514 r =
Z3_mk_fpa_mul(a.ctx(), a.ctx().fpa_rounding_mode(), a, b);
1521 return expr(a.ctx(), r);
◆ operator*() [2/3]
expr z3::operator* |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1523 of file z3++.h.
1523 {
return a * a.ctx().num_val(b, a.get_sort()); }
◆ operator*() [3/3]
expr z3::operator* |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1524 of file z3++.h.
1524 {
return b.ctx().num_val(a, b.get_sort()) * b; }
◆ operator+() [1/3]
Definition at line 1473 of file z3++.h.
1476 if (a.is_arith() && b.is_arith()) {
1477 Z3_ast args[2] = { a, b };
1480 else if (a.is_bv() && b.is_bv()) {
1483 else if (a.is_seq() && b.is_seq()) {
1486 else if (a.is_re() && b.is_re()) {
1487 Z3_ast _args[2] = { a, b };
1490 else if (a.is_fpa() && b.is_fpa()) {
1491 r =
Z3_mk_fpa_add(a.ctx(), a.ctx().fpa_rounding_mode(), a, b);
1498 return expr(a.ctx(), r);
◆ operator+() [2/3]
expr z3::operator+ |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1500 of file z3++.h.
1500 {
return a + a.ctx().num_val(b, a.get_sort()); }
◆ operator+() [3/3]
expr z3::operator+ |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1501 of file z3++.h.
1501 {
return b.ctx().num_val(a, b.get_sort()) + b; }
◆ operator-() [1/4]
Definition at line 1566 of file z3++.h.
1571 else if (a.is_bv()) {
1574 else if (a.is_fpa()) {
1582 return expr(a.ctx(), r);
◆ operator-() [2/4]
Definition at line 1585 of file z3++.h.
1588 if (a.is_arith() && b.is_arith()) {
1589 Z3_ast args[2] = { a, b };
1592 else if (a.is_bv() && b.is_bv()) {
1595 else if (a.is_fpa() && b.is_fpa()) {
1596 r =
Z3_mk_fpa_sub(a.ctx(), a.ctx().fpa_rounding_mode(), a, b);
1603 return expr(a.ctx(), r);
◆ operator-() [3/4]
expr z3::operator- |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1605 of file z3++.h.
1605 {
return a - a.ctx().num_val(b, a.get_sort()); }
◆ operator-() [4/4]
expr z3::operator- |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1606 of file z3++.h.
1606 {
return b.ctx().num_val(a, b.get_sort()) - b; }
◆ operator/() [1/3]
Definition at line 1544 of file z3++.h.
1547 if (a.is_arith() && b.is_arith()) {
1550 else if (a.is_bv() && b.is_bv()) {
1553 else if (a.is_fpa() && b.is_fpa()) {
1554 r =
Z3_mk_fpa_div(a.ctx(), a.ctx().fpa_rounding_mode(), a, b);
1561 return expr(a.ctx(), r);
◆ operator/() [2/3]
expr z3::operator/ |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1563 of file z3++.h.
1563 {
return a / a.ctx().num_val(b, a.get_sort()); }
◆ operator/() [3/3]
expr z3::operator/ |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1564 of file z3++.h.
1564 {
return b.ctx().num_val(a, b.get_sort()) / b; }
◆ operator<() [1/6]
probe z3::operator< |
( |
double |
p1, |
|
|
probe const & |
p2 |
|
) |
| |
|
inline |
Definition at line 2781 of file z3++.h.
2781 {
return probe(p2.ctx(), p1) < p2; }
◆ operator<() [2/6]
Definition at line 1633 of file z3++.h.
1636 if (a.is_arith() && b.is_arith()) {
1639 else if (a.is_bv() && b.is_bv()) {
1642 else if (a.is_fpa() && b.is_fpa()) {
1650 return expr(a.ctx(), r);
◆ operator<() [3/6]
expr z3::operator< |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1652 of file z3++.h.
1652 {
return a < a.ctx().num_val(b, a.get_sort()); }
◆ operator<() [4/6]
expr z3::operator< |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1653 of file z3++.h.
1653 {
return b.ctx().num_val(a, b.get_sort()) < b; }
◆ operator<() [5/6]
probe z3::operator< |
( |
probe const & |
p1, |
|
|
double |
p2 |
|
) |
| |
|
inline |
Definition at line 2780 of file z3++.h.
2780 {
return p1 < probe(p1.ctx(), p2); }
◆ operator<() [6/6]
◆ operator<<() [1/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
apply_result const & |
r |
|
) |
| |
|
inline |
◆ operator<<() [2/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
ast const & |
n |
|
) |
| |
|
inline |
◆ operator<<() [3/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
check_result |
r |
|
) |
| |
|
inline |
Definition at line 2335 of file z3++.h.
2336 if (r ==
unsat) out <<
"unsat";
2337 else if (r ==
sat) out <<
"sat";
2338 else out <<
"unknown";
◆ operator<<() [4/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
exception const & |
e |
|
) |
| |
|
inline |
Definition at line 93 of file z3++.h.
93 { out << e.msg();
return out; }
◆ operator<<() [5/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
fixedpoint const & |
f |
|
) |
| |
|
inline |
◆ operator<<() [6/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
goal const & |
g |
|
) |
| |
|
inline |
◆ operator<<() [7/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
model const & |
m |
|
) |
| |
|
inline |
◆ operator<<() [8/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
optimize const & |
s |
|
) |
| |
|
inline |
◆ operator<<() [9/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
param_descrs const & |
d |
|
) |
| |
|
inline |
Definition at line 459 of file z3++.h.
459 {
return out << d.to_string(); }
◆ operator<<() [10/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
params const & |
p |
|
) |
| |
|
inline |
◆ operator<<() [11/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
solver const & |
s |
|
) |
| |
|
inline |
◆ operator<<() [12/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
stats const & |
s |
|
) |
| |
|
inline |
◆ operator<<() [13/13]
std::ostream& z3::operator<< |
( |
std::ostream & |
out, |
|
|
symbol const & |
s |
|
) |
| |
|
inline |
Definition at line 428 of file z3++.h.
430 out <<
"k!" << s.to_int();
◆ operator<=() [1/6]
probe z3::operator<= |
( |
double |
p1, |
|
|
probe const & |
p2 |
|
) |
| |
|
inline |
Definition at line 2771 of file z3++.h.
2771 {
return probe(p2.ctx(), p1) <= p2; }
◆ operator<=() [2/6]
Definition at line 1608 of file z3++.h.
1611 if (a.is_arith() && b.is_arith()) {
1614 else if (a.is_bv() && b.is_bv()) {
1617 else if (a.is_fpa() && b.is_fpa()) {
1625 return expr(a.ctx(), r);
◆ operator<=() [3/6]
expr z3::operator<= |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1627 of file z3++.h.
1627 {
return a <= a.ctx().num_val(b, a.get_sort()); }
◆ operator<=() [4/6]
expr z3::operator<= |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1628 of file z3++.h.
1628 {
return b.ctx().num_val(a, b.get_sort()) <= b; }
◆ operator<=() [5/6]
probe z3::operator<= |
( |
probe const & |
p1, |
|
|
double |
p2 |
|
) |
| |
|
inline |
Definition at line 2770 of file z3++.h.
2770 {
return p1 <= probe(p1.ctx(), p2); }
◆ operator<=() [6/6]
◆ operator==() [1/6]
probe z3::operator== |
( |
double |
p1, |
|
|
probe const & |
p2 |
|
) |
| |
|
inline |
Definition at line 2791 of file z3++.h.
2791 {
return probe(p2.ctx(), p1) == p2; }
◆ operator==() [2/6]
Definition at line 1454 of file z3++.h.
1456 Z3_ast r =
Z3_mk_eq(a.ctx(), a, b);
1458 return expr(a.ctx(), r);
◆ operator==() [3/6]
expr z3::operator== |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1460 of file z3++.h.
1460 { assert(a.is_arith() || a.is_bv() || a.is_fpa());
return a == a.ctx().num_val(b, a.get_sort()); }
◆ operator==() [4/6]
expr z3::operator== |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1461 of file z3++.h.
1461 { assert(b.is_arith() || b.is_bv() || b.is_fpa());
return b.ctx().num_val(a, b.get_sort()) == b; }
◆ operator==() [5/6]
probe z3::operator== |
( |
probe const & |
p1, |
|
|
double |
p2 |
|
) |
| |
|
inline |
Definition at line 2790 of file z3++.h.
2790 {
return p1 == probe(p1.ctx(), p2); }
◆ operator==() [6/6]
◆ operator>() [1/6]
probe z3::operator> |
( |
double |
p1, |
|
|
probe const & |
p2 |
|
) |
| |
|
inline |
Definition at line 2786 of file z3++.h.
2786 {
return probe(p2.ctx(), p1) > p2; }
◆ operator>() [2/6]
Definition at line 1655 of file z3++.h.
1658 if (a.is_arith() && b.is_arith()) {
1661 else if (a.is_bv() && b.is_bv()) {
1664 else if (a.is_fpa() && b.is_fpa()) {
1672 return expr(a.ctx(), r);
◆ operator>() [3/6]
expr z3::operator> |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1674 of file z3++.h.
1674 {
return a > a.ctx().num_val(b, a.get_sort()); }
◆ operator>() [4/6]
expr z3::operator> |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1675 of file z3++.h.
1675 {
return b.ctx().num_val(a, b.get_sort()) > b; }
◆ operator>() [5/6]
probe z3::operator> |
( |
probe const & |
p1, |
|
|
double |
p2 |
|
) |
| |
|
inline |
Definition at line 2785 of file z3++.h.
2785 {
return p1 > probe(p1.ctx(), p2); }
◆ operator>() [6/6]
◆ operator>=() [1/6]
probe z3::operator>= |
( |
double |
p1, |
|
|
probe const & |
p2 |
|
) |
| |
|
inline |
Definition at line 2776 of file z3++.h.
2776 {
return probe(p2.ctx(), p1) >= p2; }
◆ operator>=() [2/6]
Definition at line 1527 of file z3++.h.
1530 if (a.is_arith() && b.is_arith()) {
1533 else if (a.is_bv() && b.is_bv()) {
1541 return expr(a.ctx(), r);
◆ operator>=() [3/6]
expr z3::operator>= |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1630 of file z3++.h.
1630 {
return a >= a.ctx().num_val(b, a.get_sort()); }
◆ operator>=() [4/6]
expr z3::operator>= |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1631 of file z3++.h.
1631 {
return b.ctx().num_val(a, b.get_sort()) >= b; }
◆ operator>=() [5/6]
probe z3::operator>= |
( |
probe const & |
p1, |
|
|
double |
p2 |
|
) |
| |
|
inline |
Definition at line 2775 of file z3++.h.
2775 {
return p1 >= probe(p1.ctx(), p2); }
◆ operator>=() [6/6]
◆ operator^() [1/3]
◆ operator^() [2/3]
expr z3::operator^ |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1682 of file z3++.h.
1682 {
return a ^ a.ctx().num_val(b, a.get_sort()); }
◆ operator^() [3/3]
expr z3::operator^ |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1683 of file z3++.h.
1683 {
return b.ctx().num_val(a, b.get_sort()) ^ b; }
◆ operator|() [1/4]
◆ operator|() [2/4]
expr z3::operator| |
( |
expr const & |
a, |
|
|
int |
b |
|
) |
| |
|
inline |
Definition at line 1686 of file z3++.h.
1686 {
return a | a.ctx().num_val(b, a.get_sort()); }
◆ operator|() [3/4]
expr z3::operator| |
( |
int |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
Definition at line 1687 of file z3++.h.
1687 {
return b.ctx().num_val(a, b.get_sort()) | b; }
◆ operator|() [4/4]
Definition at line 2686 of file z3++.h.
2690 return tactic(t1.ctx(), r);
◆ operator||() [1/4]
expr z3::operator|| |
( |
bool |
a, |
|
|
expr const & |
b |
|
) |
| |
|
inline |
- Precondition
- b.is_bool()
Definition at line 1452 of file z3++.h.
1452 {
return b.ctx().bool_val(a) || b; }
◆ operator||() [2/4]
expr z3::operator|| |
( |
expr const & |
a, |
|
|
bool |
b |
|
) |
| |
|
inline |
- Precondition
- a.is_bool()
Definition at line 1450 of file z3++.h.
1450 {
return a || a.ctx().bool_val(b); }
◆ operator||() [3/4]
- Precondition
- a.is_bool()
-
b.is_bool()
Definition at line 1441 of file z3++.h.
1443 assert(a.is_bool() && b.is_bool());
1444 Z3_ast args[2] = { a, b };
1445 Z3_ast r =
Z3_mk_or(a.ctx(), 2, args);
1447 return expr(a.ctx(), r);
◆ operator||() [4/4]
◆ operator~()
Definition at line 1745 of file z3++.h.
1745 { Z3_ast r =
Z3_mk_bvnot(a.ctx(), a);
return expr(a.ctx(), r); }
◆ option()
◆ par_and_then()
Definition at line 2718 of file z3++.h.
2722 return tactic(t1.ctx(), r);
◆ par_or()
Definition at line 2709 of file z3++.h.
2711 Z3_THROW(exception(
"a non-zero number of tactics need to be passed to par_or"));
2713 array<Z3_tactic> buffer(n);
2714 for (
unsigned i = 0; i < n; ++i) buffer[i] =
tactics[i];
◆ partial_order()
◆ pbeq()
Definition at line 2071 of file z3++.h.
2072 assert(es.size() > 0);
2073 context& ctx = es[0].ctx();
2074 array<Z3_ast> _es(es);
2075 Z3_ast r =
Z3_mk_pbeq(ctx, _es.size(), _es.ptr(), coeffs, bound);
2077 return expr(ctx, r);
◆ pbge()
Definition at line 2063 of file z3++.h.
2064 assert(es.size() > 0);
2065 context& ctx = es[0].ctx();
2066 array<Z3_ast> _es(es);
2067 Z3_ast r =
Z3_mk_pbge(ctx, _es.size(), _es.ptr(), coeffs, bound);
2069 return expr(ctx, r);
◆ pble()
Definition at line 2055 of file z3++.h.
2056 assert(es.size() > 0);
2057 context& ctx = es[0].ctx();
2058 array<Z3_ast> _es(es);
2059 Z3_ast r =
Z3_mk_pble(ctx, _es.size(), _es.ptr(), coeffs, bound);
2061 return expr(ctx, r);
◆ piecewise_linear_order()
func_decl z3::piecewise_linear_order |
( |
sort const & |
a, |
|
|
unsigned |
index |
|
) |
| |
|
inline |
◆ plus()
◆ prefixof()
Definition at line 3434 of file z3++.h.
3438 return expr(a.ctx(), r);
◆ pw() [1/3]
◆ pw() [2/3]
Definition at line 1386 of file z3++.h.
1386 {
return pw(a, a.ctx().num_val(b, a.get_sort())); }
◆ pw() [3/3]
Definition at line 1387 of file z3++.h.
1387 {
return pw(b.ctx().num_val(a, b.get_sort()), b); }
◆ range()
Definition at line 3488 of file z3++.h.
3492 return expr(lo.ctx(), r);
Referenced by AstVector::__getitem__(), z3py::AndThen(), z3py::ArraySort(), Goal::as_expr(), ApplyResult::as_expr(), FuncEntry::as_list(), FuncInterp::as_list(), z3py::AtLeast(), z3py::BoolVector(), Solver::check(), Optimize::check(), ExprRef::children(), z3py::Concat(), Solver::consequences(), z3py::CreateDatatypes(), ModelRef::decls(), z3py::describe_probes(), z3py::DisjointSum(), z3py::EnumSort(), z3py::eq(), z3py::FreshFunction(), z3py::Function(), context::function(), function(), Statistics::get_key_value(), z3py::Intersect(), z3py::IntVector(), z3py::is_quantifier(), Statistics::keys(), z3py::Lambda(), Context::mkArrayConst(), Context::mkArraySort(), Context::mkConst(), Context::mkConstDecl(), Context::mkFreshConst(), Context::mkFreshConstDecl(), Context::mkFreshFuncDecl(), Context::mkFuncDecl(), z3py::OrElse(), z3py::ParOr(), z3py::probes(), z3py::RealVarVector(), z3py::RealVector(), z3py::RecAddDefinition(), context::recfun(), recfun(), z3py::RecFunction(), z3py::set_default_fp_sort(), Fixedpoint::set_predicate_representation(), ModelRef::sorts(), z3py::substitute(), z3py::substitute_vars(), z3py::tactics(), Solver::to_smt2(), z3py::TupleSort(), z3py::Union(), and z3py::Update().
◆ re_complement()
expr z3::re_complement |
( |
expr const & |
a | ) |
|
|
inline |
◆ re_empty()
Definition at line 3467 of file z3++.h.
3470 return expr(s.ctx(), r);
◆ re_full()
Definition at line 3472 of file z3++.h.
3475 return expr(s.ctx(), r);
◆ re_intersect()
Definition at line 3477 of file z3++.h.
3478 assert(args.size() > 0);
3479 context& ctx = args[0].ctx();
3480 array<Z3_ast> _args(args);
3483 return expr(ctx, r);
◆ recfun() [1/4]
◆ recfun() [2/4]
◆ recfun() [3/4]
func_decl z3::recfun |
( |
char const * |
name, |
|
|
unsigned |
arity, |
|
|
sort const * |
domain, |
|
|
sort const & |
range |
|
) |
| |
|
inline |
◆ recfun() [4/4]
◆ rem() [1/3]
Definition at line 1405 of file z3++.h.
1406 if (a.is_fpa() && b.is_fpa()) {
Referenced by rem().
◆ rem() [2/3]
Definition at line 1412 of file z3++.h.
1412 {
return rem(a, a.ctx().num_val(b, a.get_sort())); }
◆ rem() [3/3]
Definition at line 1413 of file z3++.h.
1413 {
return rem(b.ctx().num_val(a, b.get_sort()), b); }
◆ repeat()
tactic z3::repeat |
( |
tactic const & |
t, |
|
|
unsigned |
max = UINT_MAX |
|
) |
| |
|
inline |
Definition at line 2693 of file z3++.h.
2696 return tactic(t.ctx(), r);
◆ reset_params()
void z3::reset_params |
( |
| ) |
|
|
inline |
◆ select() [1/3]
◆ select() [2/3]
Definition at line 3322 of file z3++.h.
3324 array<Z3_ast> idxs(i);
3327 return expr(a.ctx(), r);
◆ select() [3/3]
expr z3::select |
( |
expr const & |
a, |
|
|
int |
i |
|
) |
| |
|
inline |
Definition at line 3319 of file z3++.h.
3320 return select(a, a.ctx().num_val(i, a.get_sort().array_domain()));
◆ set_add()
◆ set_complement()
expr z3::set_complement |
( |
expr const & |
a | ) |
|
|
inline |
◆ set_del()
◆ set_difference()
◆ set_intersect()
Definition at line 3395 of file z3++.h.
3397 Z3_ast es[2] = { a, b };
3400 return expr(a.ctx(), r);
◆ set_member()
◆ set_param() [1/3]
void z3::set_param |
( |
char const * |
param, |
|
|
bool |
value |
|
) |
| |
|
inline |
◆ set_param() [2/3]
void z3::set_param |
( |
char const * |
param, |
|
|
char const * |
value |
|
) |
| |
|
inline |
◆ set_param() [3/3]
void z3::set_param |
( |
char const * |
param, |
|
|
int |
value |
|
) |
| |
|
inline |
◆ set_subset()
◆ set_union()
Definition at line 3387 of file z3++.h.
3389 Z3_ast es[2] = { a, b };
3392 return expr(a.ctx(), r);
◆ sext()
expr z3::sext |
( |
expr const & |
a, |
|
|
unsigned |
i |
|
) |
| |
|
inline |
Sign-extend of the given bit-vector to the (signed) equivalent bitvector of size m+i, where m is the size of the given bit-vector.
Definition at line 1923 of file z3++.h.
◆ shl() [1/3]
shift left operator for bitvectors
Definition at line 1862 of file z3++.h.
Referenced by shl().
◆ shl() [2/3]
Definition at line 1863 of file z3++.h.
1863 {
return shl(a, a.ctx().num_val(b, a.get_sort())); }
◆ shl() [3/3]
Definition at line 1864 of file z3++.h.
1864 {
return shl(b.ctx().num_val(a, b.get_sort()), b); }
◆ sle() [1/3]
signed less than or equal to operator for bitvectors.
Definition at line 1796 of file z3++.h.
Referenced by sle().
◆ sle() [2/3]
Definition at line 1797 of file z3++.h.
1797 {
return sle(a, a.ctx().num_val(b, a.get_sort())); }
◆ sle() [3/3]
Definition at line 1798 of file z3++.h.
1798 {
return sle(b.ctx().num_val(a, b.get_sort()), b); }
◆ slt() [1/3]
signed less than operator for bitvectors.
Definition at line 1802 of file z3++.h.
Referenced by slt().
◆ slt() [2/3]
Definition at line 1803 of file z3++.h.
1803 {
return slt(a, a.ctx().num_val(b, a.get_sort())); }
◆ slt() [3/3]
Definition at line 1804 of file z3++.h.
1804 {
return slt(b.ctx().num_val(a, b.get_sort()), b); }
◆ smod() [1/3]
signed modulus operator for bitvectors
Definition at line 1848 of file z3++.h.
Referenced by smod().
◆ smod() [2/3]
Definition at line 1849 of file z3++.h.
1849 {
return smod(a, a.ctx().num_val(b, a.get_sort())); }
◆ smod() [3/3]
Definition at line 1850 of file z3++.h.
1850 {
return smod(b.ctx().num_val(a, b.get_sort()), b); }
◆ sqrt()
Definition at line 1738 of file z3++.h.
1743 return expr(a.ctx(), r);
◆ srem() [1/3]
signed remainder operator for bitvectors
Definition at line 1841 of file z3++.h.
Referenced by srem().
◆ srem() [2/3]
Definition at line 1842 of file z3++.h.
1842 {
return srem(a, a.ctx().num_val(b, a.get_sort())); }
◆ srem() [3/3]
Definition at line 1843 of file z3++.h.
1843 {
return srem(b.ctx().num_val(a, b.get_sort()), b); }
◆ star()
◆ store() [1/5]
Definition at line 3330 of file z3++.h.
3334 return expr(a.ctx(), r);
Referenced by store().
◆ store() [2/5]
Definition at line 3338 of file z3++.h.
3338 {
return store(a, i, a.ctx().num_val(v, a.get_sort().array_range())); }
◆ store() [3/5]
Definition at line 3342 of file z3++.h.
3344 array<Z3_ast> idxs(i);
3345 Z3_ast r =
Z3_mk_store_n(a.ctx(), a, idxs.size(), idxs.ptr(), v);
3347 return expr(a.ctx(), r);
◆ store() [4/5]
Definition at line 3337 of file z3++.h.
3337 {
return store(a, a.ctx().num_val(i, a.get_sort().array_domain()), v); }
◆ store() [5/5]
expr z3::store |
( |
expr const & |
a, |
|
|
int |
i, |
|
|
int |
v |
|
) |
| |
|
inline |
Definition at line 3339 of file z3++.h.
3340 return store(a, a.ctx().num_val(i, a.get_sort().array_domain()), a.ctx().num_val(v, a.get_sort().array_range()));
◆ suffixof()
Definition at line 3428 of file z3++.h.
3432 return expr(a.ctx(), r);
◆ sum()
Definition at line 2095 of file z3++.h.
2096 assert(args.size() > 0);
2097 context& ctx = args[0].ctx();
2098 array<Z3_ast> _args(args);
2099 Z3_ast r =
Z3_mk_add(ctx, _args.size(), _args.ptr());
2101 return expr(ctx, r);
◆ to_check_result()
◆ to_expr()
Wraps a Z3_ast as an expr object. It also checks for errors. This function allows the user to use the whole C API with the C++ layer defined in this file.
Definition at line 1774 of file z3++.h.
Referenced by ashr(), lshr(), sext(), shl(), sle(), slt(), smod(), srem(), udiv(), uge(), ugt(), ule(), ult(), urem(), and zext().
◆ to_func_decl()
◆ to_re()
◆ to_real()
Definition at line 3270 of file z3++.h.
3270 { Z3_ast r =
Z3_mk_int2real(a.ctx(), a); a.check_error();
return expr(a.ctx(), r); }
◆ to_sort()
◆ tree_order()
◆ try_for()
Definition at line 2704 of file z3++.h.
2707 return tactic(t.ctx(), r);
◆ udiv() [1/3]
unsigned division operator for bitvectors.
Definition at line 1834 of file z3++.h.
Referenced by udiv().
◆ udiv() [2/3]
Definition at line 1835 of file z3++.h.
1835 {
return udiv(a, a.ctx().num_val(b, a.get_sort())); }
◆ udiv() [3/3]
Definition at line 1836 of file z3++.h.
1836 {
return udiv(b.ctx().num_val(a, b.get_sort()), b); }
◆ uge() [1/3]
unsigned greater than or equal to operator for bitvectors.
Definition at line 1822 of file z3++.h.
Referenced by uge().
◆ uge() [2/3]
Definition at line 1823 of file z3++.h.
1823 {
return uge(a, a.ctx().num_val(b, a.get_sort())); }
◆ uge() [3/3]
Definition at line 1824 of file z3++.h.
1824 {
return uge(b.ctx().num_val(a, b.get_sort()), b); }
◆ ugt() [1/3]
unsigned greater than operator for bitvectors.
Definition at line 1828 of file z3++.h.
Referenced by ugt().
◆ ugt() [2/3]
Definition at line 1829 of file z3++.h.
1829 {
return ugt(a, a.ctx().num_val(b, a.get_sort())); }
◆ ugt() [3/3]
Definition at line 1830 of file z3++.h.
1830 {
return ugt(b.ctx().num_val(a, b.get_sort()), b); }
◆ ule() [1/3]
unsigned less than or equal to operator for bitvectors.
Definition at line 1810 of file z3++.h.
Referenced by ule().
◆ ule() [2/3]
Definition at line 1811 of file z3++.h.
1811 {
return ule(a, a.ctx().num_val(b, a.get_sort())); }
◆ ule() [3/3]
Definition at line 1812 of file z3++.h.
1812 {
return ule(b.ctx().num_val(a, b.get_sort()), b); }
◆ ult() [1/3]
unsigned less than operator for bitvectors.
Definition at line 1816 of file z3++.h.
Referenced by ult().
◆ ult() [2/3]
Definition at line 1817 of file z3++.h.
1817 {
return ult(a, a.ctx().num_val(b, a.get_sort())); }
◆ ult() [3/3]
Definition at line 1818 of file z3++.h.
1818 {
return ult(b.ctx().num_val(a, b.get_sort()), b); }
◆ urem() [1/3]
unsigned reminder operator for bitvectors
Definition at line 1855 of file z3++.h.
Referenced by urem().
◆ urem() [2/3]
Definition at line 1856 of file z3++.h.
1856 {
return urem(a, a.ctx().num_val(b, a.get_sort())); }
◆ urem() [3/3]
Definition at line 1857 of file z3++.h.
1857 {
return urem(b.ctx().num_val(a, b.get_sort()), b); }
◆ when()
Definition at line 2949 of file z3++.h.
2953 return tactic(t.ctx(), r);
◆ with()
Definition at line 2699 of file z3++.h.
2702 return tactic(t.ctx(), r);
◆ xnor()
◆ zext()
expr z3::zext |
( |
expr const & |
a, |
|
|
unsigned |
i |
|
) |
| |
|
inline |
Extend the given bit-vector with zeros to the (unsigned) equivalent bitvector of size m+i, where m is the size of the given bit-vector.
Definition at line 1883 of file z3++.h.
Z3_ast Z3_API Z3_mk_re_plus(Z3_context c, Z3_ast re)
Create the regular language re+.
void Z3_API Z3_global_param_reset_all(void)
Restore the value of all global (and module) parameters. This command will not affect already created...
Z3_ast Z3_API Z3_mk_unary_minus(Z3_context c, Z3_ast arg)
Create an AST node representing - arg.
Z3_ast Z3_API Z3_mk_store_n(Z3_context c, Z3_ast a, unsigned n, Z3_ast const *idxs, Z3_ast v)
n-ary Array update.
Z3_string Z3_API Z3_apply_result_to_string(Z3_context c, Z3_apply_result r)
Convert the Z3_apply_result object returned by Z3_tactic_apply into a string.
Z3_ast Z3_API Z3_mk_re_option(Z3_context c, Z3_ast re)
Create the regular language [re].
Z3_ast Z3_API Z3_mk_bvshl(Z3_context c, Z3_ast t1, Z3_ast t2)
Shift left.
Z3_tactic Z3_API Z3_tactic_par_and_then(Z3_context c, Z3_tactic t1, Z3_tactic t2)
Return a tactic that applies t1 to a given goal and then t2 to every subgoal produced by t1....
Z3_ast Z3_API Z3_mk_forall_const(Z3_context c, unsigned weight, unsigned num_bound, Z3_app const bound[], unsigned num_patterns, Z3_pattern const patterns[], Z3_ast body)
Create a universal quantifier using a list of constants that will form the set of bound variables.
Z3_ast Z3_API Z3_mk_select(Z3_context c, Z3_ast a, Z3_ast i)
Array read. The argument a is the array and i is the index of the array that gets read.
Z3_string Z3_API Z3_solver_to_string(Z3_context c, Z3_solver s)
Convert a solver into a string.
Z3_ast Z3_API Z3_mk_re_complement(Z3_context c, Z3_ast re)
Create the complement of the regular language re.
Z3_ast Z3_API Z3_mk_fpa_min(Z3_context c, Z3_ast t1, Z3_ast t2)
Minimum of floating-point numbers.
expr smod(int a, expr const &b)
Z3_ast Z3_API Z3_mk_bvslt(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed less than.
Z3_ast Z3_API Z3_mk_ge(Z3_context c, Z3_ast t1, Z3_ast t2)
Create greater than or equal to.
Z3_ast Z3_API Z3_mk_bvmul_no_underflow(Z3_context c, Z3_ast t1, Z3_ast t2)
Create a predicate that checks that the bit-wise signed multiplication of t1 and t2 does not underflo...
Z3_ast Z3_API Z3_mk_bvmul_no_overflow(Z3_context c, Z3_ast t1, Z3_ast t2, bool is_signed)
Create a predicate that checks that the bit-wise multiplication of t1 and t2 does not overflow.
Z3_ast Z3_API Z3_mk_fpa_rem(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point remainder.
Z3_probe Z3_API Z3_probe_le(Z3_context x, Z3_probe p1, Z3_probe p2)
Return a probe that evaluates to "true" when the value returned by p1 is less than or equal to the va...
#define _Z3_MK_BIN_(a, b, binop)
Z3_ast_kind Z3_API Z3_get_ast_kind(Z3_context c, Z3_ast a)
Return the kind of the given AST.
Z3_probe Z3_API Z3_probe_and(Z3_context x, Z3_probe p1, Z3_probe p2)
Return a probe that evaluates to "true" when p1 and p2 evaluates to true.
expr pw(int a, expr const &b)
Z3_ast Z3_API Z3_mk_zero_ext(Z3_context c, unsigned i, Z3_ast t1)
Extend the given bit-vector with zeros to the (unsigned) equivalent bit-vector of size m+i,...
Z3_ast Z3_API Z3_mk_seq_concat(Z3_context c, unsigned n, Z3_ast const args[])
Concatenate sequences.
Z3_tactic Z3_API Z3_tactic_fail_if(Z3_context c, Z3_probe p)
Return a tactic that fails if the probe p evaluates to false.
Z3_ast Z3_API Z3_mk_gt(Z3_context c, Z3_ast t1, Z3_ast t2)
Create greater than.
Z3_tactic Z3_API Z3_tactic_try_for(Z3_context c, Z3_tactic t, unsigned ms)
Return a tactic that applies t to a given goal for ms milliseconds. If t does not terminate in ms mil...
Z3_ast Z3_API Z3_mk_fpa_fma(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2, Z3_ast t3)
Floating-point fused multiply-add.
expr range(expr const &lo, expr const &hi)
Z3_ast Z3_API Z3_mk_re_full(Z3_context c, Z3_sort re)
Create an universal regular expression of sort re.
Z3_ast Z3_API Z3_mk_bv2int(Z3_context c, Z3_ast t1, bool is_signed)
Create an integer from the bit-vector argument t1. If is_signed is false, then the bit-vector t1 is t...
Z3_ast Z3_API Z3_mk_and(Z3_context c, unsigned num_args, Z3_ast const args[])
Create an AST node representing args[0] and ... and args[num_args-1].
Z3_ast Z3_API Z3_mk_fpa_sqrt(Z3_context c, Z3_ast rm, Z3_ast t)
Floating-point square root.
Z3_string Z3_API Z3_params_to_string(Z3_context c, Z3_params p)
Convert a parameter set into a string. This function is mainly used for printing the contents of a pa...
Z3_ast Z3_API Z3_mk_set_del(Z3_context c, Z3_ast set, Z3_ast elem)
Remove an element to a set.
Z3_ast Z3_API Z3_mk_seq_suffix(Z3_context c, Z3_ast suffix, Z3_ast s)
Check if suffix is a suffix of s.
expr rem(int a, expr const &b)
Z3_ast Z3_API Z3_mk_bvneg_no_overflow(Z3_context c, Z3_ast t1)
Check that bit-wise negation does not overflow when t1 is interpreted as a signed bit-vector.
Z3_ast Z3_API Z3_mk_bvmul(Z3_context c, Z3_ast t1, Z3_ast t2)
Standard two's complement multiplication.
Z3_ast Z3_API Z3_mk_full_set(Z3_context c, Z3_sort domain)
Create the full set.
bool Z3_API Z3_is_eq_ast(Z3_context c, Z3_ast t1, Z3_ast t2)
Compare terms.
Z3_ast Z3_API Z3_mk_or(Z3_context c, unsigned num_args, Z3_ast const args[])
Create an AST node representing args[0] or ... or args[num_args-1].
Z3_ast Z3_API Z3_mk_set_union(Z3_context c, unsigned num_args, Z3_ast const args[])
Take the union of a list of sets.
Z3_ast Z3_API Z3_mk_set_intersect(Z3_context c, unsigned num_args, Z3_ast const args[])
Take the intersection of a list of sets.
expr shl(int a, expr const &b)
Z3_ast Z3_API Z3_mk_distinct(Z3_context c, unsigned num_args, Z3_ast const args[])
Create an AST node representing distinct(args[0], ..., args[num_args-1]).
Z3_ast Z3_API Z3_mk_empty_set(Z3_context c, Z3_sort domain)
Create the empty set.
Z3_ast Z3_API Z3_mk_bvnor(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise nor.
Z3_ast Z3_API Z3_mk_fpa_leq(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point less than or equal.
Z3_func_decl Z3_API Z3_mk_linear_order(Z3_context c, Z3_sort a, unsigned id)
create a linear ordering relation over signature a. The relation is identified by the index id.
Z3_string Z3_API Z3_optimize_to_string(Z3_context c, Z3_optimize o)
Print the current context as a string.
Z3_ast Z3_API Z3_mk_add(Z3_context c, unsigned num_args, Z3_ast const args[])
Create an AST node representing args[0] + ... + args[num_args-1].
func_decl function(symbol const &name, unsigned arity, sort const *domain, sort const &range)
Z3_probe Z3_API Z3_probe_or(Z3_context x, Z3_probe p1, Z3_probe p2)
Return a probe that evaluates to "true" when p1 or p2 evaluates to true.
Z3_ast Z3_API Z3_mk_bvugt(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned greater than.
Z3_ast Z3_API Z3_mk_seq_prefix(Z3_context c, Z3_ast prefix, Z3_ast s)
Check if prefix is a prefix of s.
Z3_ast Z3_API Z3_mk_concat(Z3_context c, Z3_ast t1, Z3_ast t2)
Concatenate the given bit-vectors.
Z3_ast Z3_API Z3_mk_implies(Z3_context c, Z3_ast t1, Z3_ast t2)
Create an AST node representing t1 implies t2.
Z3_ast Z3_API Z3_mk_rem(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Create an AST node representing arg1 rem arg2.
Z3_ast Z3_API Z3_mk_pbeq(Z3_context c, unsigned num_args, Z3_ast const args[], int const coeffs[], int k)
Pseudo-Boolean relations.
bool Z3_API Z3_is_re_sort(Z3_context c, Z3_sort s)
Check if s is a regular expression sort.
#define _Z3_MK_UN_(a, mkun)
Z3_ast Z3_API Z3_mk_bvadd_no_overflow(Z3_context c, Z3_ast t1, Z3_ast t2, bool is_signed)
Create a predicate that checks that the bit-wise addition of t1 and t2 does not overflow.
expr slt(int a, expr const &b)
Z3_ast Z3_API Z3_mk_bvnot(Z3_context c, Z3_ast t1)
Bitwise negation.
Z3_string Z3_API Z3_ast_to_string(Z3_context c, Z3_ast a)
Convert the given AST node into a string.
expr ugt(int a, expr const &b)
Z3_ast Z3_API Z3_mk_re_star(Z3_context c, Z3_ast re)
Create the regular language re*.
Z3_ast Z3_API Z3_mk_eq(Z3_context c, Z3_ast l, Z3_ast r)
Create an AST node representing l = r.
expr lshr(int a, expr const &b)
Z3_ast Z3_API Z3_mk_fpa_gt(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point greater than.
Z3_ast Z3_API Z3_mk_set_complement(Z3_context c, Z3_ast arg)
Take the complement of a set.
Z3_ast Z3_API Z3_mk_fpa_sub(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2)
Floating-point subtraction.
Z3_ast Z3_API Z3_mk_fpa_neg(Z3_context c, Z3_ast t)
Floating-point negation.
expr ashr(int a, expr const &b)
Z3_tactic Z3_API Z3_tactic_using_params(Z3_context c, Z3_tactic t, Z3_params p)
Return a tactic that applies t using the given set of parameters.
expr srem(int a, expr const &b)
Z3_ast Z3_API Z3_mk_exists_const(Z3_context c, unsigned weight, unsigned num_bound, Z3_app const bound[], unsigned num_patterns, Z3_pattern const patterns[], Z3_ast body)
Similar to Z3_mk_forall_const.
Z3_ast Z3_API Z3_mk_bvsge(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed greater than or equal to.
expr ule(int a, expr const &b)
Z3_ast Z3_API Z3_mk_seq_last_index(Z3_context c, Z3_ast, Z3_ast substr)
Return the last occurrence of substr in s. If s does not contain substr, then the value is -1,...
Z3_ast Z3_API Z3_mk_bvadd(Z3_context c, Z3_ast t1, Z3_ast t2)
Standard two's complement addition.
Z3_string Z3_API Z3_stats_to_string(Z3_context c, Z3_stats s)
Convert a statistics into a string.
expr concat(expr_vector const &args)
Z3_ast Z3_API Z3_mk_bvneg(Z3_context c, Z3_ast t1)
Standard two's complement unary minus.
expr ult(int a, expr const &b)
Z3_ast Z3_API Z3_mk_re_range(Z3_context c, Z3_ast lo, Z3_ast hi)
Create the range regular expression over two sequences of length 1.
Z3_ast Z3_API Z3_mk_ite(Z3_context c, Z3_ast t1, Z3_ast t2, Z3_ast t3)
Create an AST node representing an if-then-else: ite(t1, t2, t3).
Z3_ast Z3_API Z3_mk_seq_in_re(Z3_context c, Z3_ast seq, Z3_ast re)
Check if seq is in the language generated by the regular expression re.
Z3_ast Z3_API Z3_mk_set_difference(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Take the set difference between two sets.
Z3_ast Z3_API Z3_mk_bvule(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned less than or equal to.
expr sle(int a, expr const &b)
expr udiv(int a, expr const &b)
func_decl recfun(symbol const &name, unsigned arity, sort const *domain, sort const &range)
expr to_expr(context &c, Z3_ast a)
Wraps a Z3_ast as an expr object. It also checks for errors. This function allows the user to use the...
Z3_tactic Z3_API Z3_tactic_cond(Z3_context c, Z3_probe p, Z3_tactic t1, Z3_tactic t2)
Return a tactic that applies t1 to a given goal if the probe p evaluates to true, and t2 if p evaluat...
Z3_ast Z3_API Z3_mk_power(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Create an AST node representing arg1 ^ arg2.
Z3_ast Z3_API Z3_mk_fpa_div(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2)
Floating-point division.
expr select(expr const &a, int i)
Z3_string Z3_API Z3_goal_to_string(Z3_context c, Z3_goal g)
Convert a goal into a string.
Z3_ast Z3_API Z3_mk_div(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Create an AST node representing arg1 div arg2.
Z3_tactic Z3_API Z3_tactic_repeat(Z3_context c, Z3_tactic t, unsigned max)
Return a tactic that keeps applying t until the goal is not modified anymore or the maximum number of...
Z3_ast Z3_API Z3_mk_lt(Z3_context c, Z3_ast t1, Z3_ast t2)
Create less than.
Z3_ast Z3_API Z3_mk_seq_to_re(Z3_context c, Z3_ast seq)
Create a regular expression that accepts the sequence seq.
Z3_probe Z3_API Z3_probe_ge(Z3_context x, Z3_probe p1, Z3_probe p2)
Return a probe that evaluates to "true" when the value returned by p1 is greater than or equal to the...
Z3_ast Z3_API Z3_mk_bvashr(Z3_context c, Z3_ast t1, Z3_ast t2)
Arithmetic shift right.
Z3_ast Z3_API Z3_mk_bvurem(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned remainder.
expr implies(bool a, expr const &b)
Z3_ast Z3_API Z3_mk_bvsub_no_overflow(Z3_context c, Z3_ast t1, Z3_ast t2)
Create a predicate that checks that the bit-wise signed subtraction of t1 and t2 does not overflow.
expr store(expr const &a, expr_vector const &i, expr const &v)
Z3_ast Z3_API Z3_mk_bvsmod(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed remainder (sign follows divisor).
Z3_probe Z3_API Z3_probe_eq(Z3_context x, Z3_probe p1, Z3_probe p2)
Return a probe that evaluates to "true" when the value returned by p1 is equal to the value returned ...
expr urem(int a, expr const &b)
Z3_ast Z3_API Z3_mk_as_array(Z3_context c, Z3_func_decl f)
Create array with the same interpretation as a function. The array satisfies the property (f x) = (se...
Z3_ast Z3_API Z3_mk_bvadd_no_underflow(Z3_context c, Z3_ast t1, Z3_ast t2)
Create a predicate that checks that the bit-wise signed addition of t1 and t2 does not underflow.
Z3_probe Z3_API Z3_probe_lt(Z3_context x, Z3_probe p1, Z3_probe p2)
Return a probe that evaluates to "true" when the value returned by p1 is less than the value returned...
Z3_ast Z3_API Z3_mk_seq_empty(Z3_context c, Z3_sort seq)
Create an empty sequence of the sequence sort seq.
Z3_ast Z3_API Z3_mk_select_n(Z3_context c, Z3_ast a, unsigned n, Z3_ast const *idxs)
n-ary Array read. The argument a is the array and idxs are the indices of the array that gets read.
Z3_probe Z3_API Z3_probe_not(Z3_context x, Z3_probe p)
Return a probe that evaluates to "true" when p does not evaluate to true.
Z3_ast Z3_API Z3_mk_bvsle(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed less than or equal to.
Z3_ast Z3_API Z3_mk_int2bv(Z3_context c, unsigned n, Z3_ast t1)
Create an n bit bit-vector from the integer argument t1.
bool Z3_API Z3_is_seq_sort(Z3_context c, Z3_sort s)
Check if s is a sequence sort.
Z3_string Z3_API Z3_fixedpoint_to_string(Z3_context c, Z3_fixedpoint f, unsigned num_queries, Z3_ast queries[])
Print the current rules and background axioms as a string.
expr max(expr const &a, expr const &b)
Z3_ast Z3_API Z3_mk_atleast(Z3_context c, unsigned num_args, Z3_ast const args[], unsigned k)
Pseudo-Boolean relations.
Z3_ast Z3_API Z3_mk_bvnand(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise nand.
Z3_ast Z3_API Z3_mk_bvsdiv(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed division.
Z3_string Z3_API Z3_model_to_string(Z3_context c, Z3_model m)
Convert the given model into a string.
Z3_ast Z3_API Z3_mk_set_member(Z3_context c, Z3_ast elem, Z3_ast set)
Check for set membership.
Z3_tactic Z3_API Z3_tactic_par_or(Z3_context c, unsigned num, Z3_tactic const ts[])
Return a tactic that applies the given tactics in parallel.
void check_context(object const &a, object const &b)
Z3_ast Z3_API Z3_mk_fpa_lt(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point less than.
Z3_ast Z3_API Z3_mk_bvult(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned less than.
Z3_ast Z3_API Z3_mk_re_union(Z3_context c, unsigned n, Z3_ast const args[])
Create the union of the regular languages.
Z3_ast Z3_API Z3_mk_bvudiv(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned division.
Z3_ast Z3_API Z3_mk_bvsub(Z3_context c, Z3_ast t1, Z3_ast t2)
Standard two's complement subtraction.
Z3_probe Z3_API Z3_probe_gt(Z3_context x, Z3_probe p1, Z3_probe p2)
Return a probe that evaluates to "true" when the value returned by p1 is greater than the value retur...
Z3_ast Z3_API Z3_mk_sign_ext(Z3_context c, unsigned i, Z3_ast t1)
Sign-extend of the given bit-vector to the (signed) equivalent bit-vector of size m+i,...
Z3_func_decl Z3_API Z3_mk_tree_order(Z3_context c, Z3_sort a, unsigned id)
create a tree ordering relation over signature a identified using index id.
Z3_ast Z3_API Z3_mk_pble(Z3_context c, unsigned num_args, Z3_ast const args[], int const coeffs[], int k)
Pseudo-Boolean relations.
Z3_ast Z3_API Z3_mk_bvand(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise and.
expr uge(int a, expr const &b)
Z3_ast Z3_API Z3_mk_bvxnor(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise xnor.
Z3_ast Z3_API Z3_mk_bvsub_no_underflow(Z3_context c, Z3_ast t1, Z3_ast t2, bool is_signed)
Create a predicate that checks that the bit-wise subtraction of t1 and t2 does not underflow.
Z3_ast Z3_API Z3_mk_fpa_max(Z3_context c, Z3_ast t1, Z3_ast t2)
Maximum of floating-point numbers.
Z3_ast Z3_API Z3_mk_store(Z3_context c, Z3_ast a, Z3_ast i, Z3_ast v)
Array update.
Z3_ast Z3_API Z3_mk_not(Z3_context c, Z3_ast a)
Create an AST node representing not(a).
Z3_ast Z3_API Z3_mk_fpa_mul(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2)
Floating-point multiplication.
#define MK_EXPR2(_fn, _arg1, _arg2)
Z3_ast Z3_API Z3_mk_set_add(Z3_context c, Z3_ast set, Z3_ast elem)
Add an element to a set.
Z3_ast Z3_API Z3_mk_seq_index(Z3_context c, Z3_ast s, Z3_ast substr, Z3_ast offset)
Return index of first occurrence of substr in s starting from offset offset. If s does not contain su...
Z3_ast Z3_API Z3_mk_const_array(Z3_context c, Z3_sort domain, Z3_ast v)
Create the constant array.
func_decl to_func_decl(context &c, Z3_func_decl f)
Z3_ast Z3_API Z3_mk_int2real(Z3_context c, Z3_ast t1)
Coerce an integer to a real.
Z3_ast Z3_API Z3_mk_re_intersect(Z3_context c, unsigned n, Z3_ast const args[])
Create the intersection of the regular languages.
Z3_ast Z3_API Z3_mk_fpa_add(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2)
Floating-point addition.
Z3_ast Z3_API Z3_mk_bvxor(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise exclusive-or.
Z3_ast Z3_API Z3_mk_fpa_abs(Z3_context c, Z3_ast t)
Floating-point absolute value.
#define MK_EXPR1(_fn, _arg)
Z3_ast Z3_API Z3_mk_is_int(Z3_context c, Z3_ast t1)
Check if a real number is an integer.
void Z3_API Z3_global_param_set(Z3_string param_id, Z3_string param_value)
Set a global (or module) parameter. This setting is shared by all Z3 contexts.
Z3_ast Z3_API Z3_mk_bvsdiv_no_overflow(Z3_context c, Z3_ast t1, Z3_ast t2)
Create a predicate that checks that the bit-wise signed division of t1 and t2 does not overflow.
Z3_ast Z3_API Z3_mk_bvuge(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned greater than or equal to.
expr mod(int a, expr const &b)
Z3_ast Z3_API Z3_mk_atmost(Z3_context c, unsigned num_args, Z3_ast const args[], unsigned k)
Pseudo-Boolean relations.
Z3_ast Z3_API Z3_mk_bvsrem(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed remainder (sign follows dividend).
Z3_ast Z3_API Z3_mk_mod(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Create an AST node representing arg1 mod arg2.
Z3_ast Z3_API Z3_mk_lambda_const(Z3_context c, unsigned num_bound, Z3_app const bound[], Z3_ast body)
Create a lambda expression using a list of constants that form the set of bound variables.
Z3_tactic Z3_API Z3_tactic_and_then(Z3_context c, Z3_tactic t1, Z3_tactic t2)
Return a tactic that applies t1 to a given goal and t2 to every subgoal produced by t1.
Z3_tactic Z3_API Z3_tactic_or_else(Z3_context c, Z3_tactic t1, Z3_tactic t2)
Return a tactic that first applies t1 to a given goal, if it fails then returns the result of t2 appl...
Z3_ast Z3_API Z3_mk_set_subset(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Check for subsetness of sets.
Z3_ast Z3_API Z3_mk_le(Z3_context c, Z3_ast t1, Z3_ast t2)
Create less than or equal to.
Z3_ast Z3_API Z3_mk_bvsgt(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed greater than.
Z3_ast Z3_API Z3_mk_bvlshr(Z3_context c, Z3_ast t1, Z3_ast t2)
Logical shift right.
Z3_ast Z3_API Z3_mk_pbge(Z3_context c, unsigned num_args, Z3_ast const args[], int const coeffs[], int k)
Pseudo-Boolean relations.
Z3_ast Z3_API Z3_mk_sub(Z3_context c, unsigned num_args, Z3_ast const args[])
Create an AST node representing args[0] - ... - args[num_args - 1].
Z3_ast Z3_API Z3_mk_re_empty(Z3_context c, Z3_sort re)
Create an empty regular expression of sort re.
Z3_tactic Z3_API Z3_tactic_when(Z3_context c, Z3_probe p, Z3_tactic t)
Return a tactic that applies t to a given goal is the probe p evaluates to true. If p evaluates to fa...
Z3_ast Z3_API Z3_mk_re_concat(Z3_context c, unsigned n, Z3_ast const args[])
Create the concatenation of the regular languages.
Z3_ast Z3_API Z3_mk_mul(Z3_context c, unsigned num_args, Z3_ast const args[])
Create an AST node representing args[0] * ... * args[num_args-1].
Z3_ast Z3_API Z3_mk_bvor(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise or.
Z3_func_decl Z3_API Z3_mk_partial_order(Z3_context c, Z3_sort a, unsigned id)
create a partial ordering relation over signature a and index id.
Z3_func_decl Z3_API Z3_mk_piecewise_linear_order(Z3_context c, Z3_sort a, unsigned id)
create a piecewise linear ordering relation over signature a and index id.