Z3
 
Loading...
Searching...
No Matches
Data Structures | Typedefs | Enumerations | Functions
z3 Namespace Reference

Z3 C++ namespace. More...

Data Structures

class  apply_result
 
class  array
 
class  ast
 
class  ast_map
 A map from ASTs to ASTs. More...
 
class  ast_vector_tpl
 
class  cast_ast
 
class  cast_ast< ast >
 
class  cast_ast< expr >
 
class  cast_ast< func_decl >
 
class  cast_ast< sort >
 
class  config
 Z3 global configuration object. More...
 
class  constructor_list
 
class  constructors
 
class  context
 A Context manages all other Z3 objects, global configuration options, etc. More...
 
class  exception
 Exception used to sign API usage errors. More...
 
class  expr
 A Z3 expression is used to represent formulas and terms. For Z3, a formula is any expression of sort Boolean. Every expression has a sort. More...
 
class  fixedpoint
 
class  func_decl
 Function declaration (aka function definition). It is the signature of interpreted and uninterpreted functions in Z3. The basic building block in Z3 is the function application. More...
 
class  func_entry
 
class  func_interp
 
class  goal
 
class  model
 
class  object
 
class  on_clause
 
class  optimize
 
class  param_descrs
 
class  parameter
 class for auxiliary parameters associated with func_decl The class is initialized with a func_decl or application expression and an index The accessor get_expr, get_sort, ... is available depending on the value of kind(). The caller is responsible to check that the kind of the parameter aligns with the call (get_expr etc). More...
 
class  params
 
class  parser_context
 
class  probe
 
class  rcf_num
 Wrapper for Z3 Real Closed Field (RCF) numerals. More...
 
class  simplifier
 
class  solver
 
class  sort
 A Z3 sort (aka type). Every expression (i.e., formula or term) in Z3 has a sort. More...
 
class  stats
 
class  symbol
 
class  tactic
 
class  user_propagator_base
 

Typedefs

typedef ast_vector_tpl< astast_vector
 
typedef ast_vector_tpl< exprexpr_vector
 
typedef ast_vector_tpl< sortsort_vector
 
typedef ast_vector_tpl< func_declfunc_decl_vector
 
typedef std::function< void(expr const &proof, std::vector< unsigned > const &deps, expr_vector const &clause)> on_clause_eh_t
 

Enumerations

enum  check_result { unsat , sat , unknown }
 
enum  rounding_mode {
  RNA , RNE , RTP , RTN ,
  RTZ
}
 

Functions

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 ()
 
void get_version (unsigned &major, unsigned &minor, unsigned &build_number, unsigned &revision_number)
 Return Z3 version number information.
 
std::string get_full_version ()
 Return a string that fully describes the version of Z3 in use.
 
void enable_trace (char const *tag)
 Enable tracing messages tagged as tag when Z3 is compiled in debug mode. It is a NOOP otherwise.
 
void disable_trace (char const *tag)
 Disable tracing messages tagged as tag when Z3 is compiled in debug mode. It is a NOOP otherwise.
 
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
 
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, double b)
 
expr operator== (double 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, double b)
 
expr operator!= (double 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 bvredor (expr const &a)
 
expr bvredand (expr const &a)
 
expr abs (expr const &a)
 
expr sqrt (expr const &a, expr const &rm)
 
expr fp_eq (expr const &a, expr const &b)
 
expr operator~ (expr const &a)
 
expr fma (expr const &a, expr const &b, expr const &c, expr const &rm)
 
expr fpa_fp (expr const &sgn, expr const &exp, expr const &sig)
 
expr fpa_to_sbv (expr const &t, unsigned sz)
 
expr fpa_to_ubv (expr const &t, unsigned sz)
 
expr sbv_to_fpa (expr const &t, sort s)
 
expr ubv_to_fpa (expr const &t, sort s)
 
expr fpa_to_fpa (expr const &t, sort s)
 
expr round_fpa_to_closest_integer (expr const &t)
 
expr ite (expr const &c, expr const &t, expr const &e)
 Create the if-then-else expression ite(c, t, e)
 
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.
 
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.
 
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.
 
expr slt (expr const &a, int b)
 
expr slt (int a, expr const &b)
 
expr sge (expr const &a, expr const &b)
 signed greater than or equal to operator for bitvectors.
 
expr sge (expr const &a, int b)
 
expr sge (int a, expr const &b)
 
expr sgt (expr const &a, expr const &b)
 signed greater than operator for bitvectors.
 
expr sgt (expr const &a, int b)
 
expr sgt (int a, expr const &b)
 
expr ule (expr const &a, expr const &b)
 unsigned less than or equal to operator for bitvectors.
 
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.
 
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.
 
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.
 
expr ugt (expr const &a, int b)
 
expr ugt (int a, expr const &b)
 
expr sdiv (expr const &a, expr const &b)
 signed division operator for bitvectors.
 
expr sdiv (expr const &a, int b)
 
expr sdiv (int a, expr const &b)
 
expr udiv (expr const &a, expr const &b)
 unsigned division operator for bitvectors.
 
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
 
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
 
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
 
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
 
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
 
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
 
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.
 
expr bv2int (expr const &a, bool is_signed)
 bit-vector and integer conversions.
 
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
 
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.
 
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_vector polynomial_subresultants (expr const &p, expr const &q, expr const &x)
 Return the nonzero subresultants of p and q with respect to the "variable" x.
 
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 map (expr const &f, expr const &list)
 
expr mapi (expr const &f, expr const &i, expr const &list)
 
expr foldl (expr const &f, expr const &a, expr const &list)
 
expr foldli (expr const &f, expr const &i, expr const &a, expr const &list)
 
expr mk_or (expr_vector const &args)
 
expr mk_and (expr_vector const &args)
 
expr mk_xor (expr_vector const &args)
 
expr qe_lite (expr_vector const &vars, expr const &body)
 
std::vector< Z3_app > to_apps (expr_vector const &bounds)
 
expr qe_model_project (model const &m, expr_vector const &bounds, expr const &body)
 
expr qe_model_project_skolem (model const &m, expr_vector const &bounds, expr const &body, ast_map &map)
 Project variables and write the introduced Skolem terms to map.
 
expr qe_model_project_with_witness (model const &m, expr_vector const &bounds, expr const &body, ast_map &map)
 Project variables and write the introduced witnesses to map.
 
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)
 
simplifier operator& (simplifier const &t1, simplifier const &t2)
 
simplifier with (simplifier const &t, params const &p)
 
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 array_default (expr const &a)
 
expr array_ext (expr const &a, expr const &b)
 
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 finite_set_empty (sort const &s)
 
expr finite_set_singleton (expr const &e)
 
expr finite_set_union (expr const &a, expr const &b)
 
expr finite_set_intersect (expr const &a, expr const &b)
 
expr finite_set_difference (expr const &a, expr const &b)
 
expr finite_set_member (expr const &e, expr const &s)
 
expr finite_set_size (expr const &s)
 
expr finite_set_subset (expr const &a, expr const &b)
 
expr finite_set_map (expr const &f, expr const &s)
 
expr finite_set_filter (expr const &f, expr const &s)
 
expr finite_set_range (expr const &low, expr const &high)
 
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_diff (expr const &a, expr const &b)
 
expr re_complement (expr const &a)
 
expr range (expr const &lo, expr const &hi)
 
rcf_num rcf_pi (context &c)
 Create an RCF numeral representing pi.
 
rcf_num rcf_e (context &c)
 Create an RCF numeral representing e (Euler's constant).
 
rcf_num rcf_infinitesimal (context &c)
 Create an RCF numeral representing an infinitesimal.
 
std::vector< rcf_numrcf_roots (context &c, std::vector< rcf_num > const &coeffs)
 Find roots of a polynomial with given coefficients.
 

Detailed Description

Z3 C++ namespace.

Typedef Documentation

◆ ast_vector

Definition at line 76 of file z3++.h.

◆ expr_vector

Definition at line 77 of file z3++.h.

◆ func_decl_vector

Definition at line 79 of file z3++.h.

◆ on_clause_eh_t

typedef std::function<void(expr const& proof, std::vector<unsigned> const& deps, expr_vector const& clause)> on_clause_eh_t

Definition at line 4724 of file z3++.h.

◆ sort_vector

Definition at line 78 of file z3++.h.

Enumeration Type Documentation

◆ check_result

Enumerator
unsat 
sat 
unknown 

Definition at line 166 of file z3++.h.

166 {
167 unsat, sat, unknown
168 };

◆ rounding_mode

Enumerator
RNA 
RNE 
RTP 
RTN 
RTZ 

Definition at line 170 of file z3++.h.

170 {
171 RNA,
172 RNE,
173 RTP,
174 RTN,
175 RTZ
176 };
@ RNE
Definition z3++.h:172
@ RNA
Definition z3++.h:171
@ RTZ
Definition z3++.h:175
@ RTN
Definition z3++.h:174
@ RTP
Definition z3++.h:173

Function Documentation

◆ abs()

expr abs ( expr const a)
inline

Definition at line 2206 of file z3++.h.

2206 {
2207 Z3_ast r;
2208 if (a.is_int()) {
2209 expr zero = a.ctx().int_val(0);
2210 expr ge = a >= zero;
2211 expr na = -a;
2212 r = Z3_mk_ite(a.ctx(), ge, a, na);
2213 }
2214 else if (a.is_real()) {
2215 expr zero = a.ctx().real_val(0);
2216 expr ge = a >= zero;
2217 expr na = -a;
2218 r = Z3_mk_ite(a.ctx(), ge, a, na);
2219 }
2220 else {
2221 r = Z3_mk_fpa_abs(a.ctx(), a);
2222 }
2223 a.check_error();
2224 return expr(a.ctx(), r);
2225 }
A Z3 expression is used to represent formulas and terms. For Z3, a formula is any expression of sort ...
Definition z3++.h:993
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_fpa_abs(Z3_context c, Z3_ast t)
Floating-point absolute value.

◆ array_default()

expr array_default ( expr const a)
inline

Definition at line 4375 of file z3++.h.

4375 {
4376 Z3_ast r = Z3_mk_array_default(a.ctx(), a);
4377 a.check_error();
4378 return expr(a.ctx(), r);
4379 }
Z3_ast Z3_API Z3_mk_array_default(Z3_context c, Z3_ast array)
Access the array default value. Produces the default range value, for arrays that can be represented ...

◆ array_ext()

expr array_ext ( expr const a,
expr const b 
)
inline

Definition at line 4381 of file z3++.h.

4381 {
4382 check_context(a, b);
4383 Z3_ast r = Z3_mk_array_ext(a.ctx(), a, b);
4384 a.check_error();
4385 return expr(a.ctx(), r);
4386 }
Z3_ast Z3_API Z3_mk_array_ext(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Create array extensionality index given two arrays with the same sort. The meaning is given by the ax...
void check_context(object const &a, object const &b)
Definition z3++.h:564

◆ as_array()

expr as_array ( func_decl f)
inline

Definition at line 4369 of file z3++.h.

4369 {
4370 Z3_ast r = Z3_mk_as_array(f.ctx(), f);
4371 f.check_error();
4372 return expr(f.ctx(), r);
4373 }
Z3_error_code check_error() const
Definition z3++.h:561
context & ctx() const
Definition z3++.h:560
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...

◆ ashr() [1/3]

expr ashr ( expr const a,
expr const b 
)
inline

arithmetic shift right operator for bitvectors

Definition at line 2440 of file z3++.h.

2440{ return to_expr(a.ctx(), Z3_mk_bvashr(a.ctx(), a, b)); }
Z3_ast Z3_API Z3_mk_bvashr(Z3_context c, Z3_ast t1, Z3_ast t2)
Arithmetic shift right.
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...
Definition z3++.h:2318

Referenced by ashr(), and ashr().

◆ ashr() [2/3]

expr ashr ( expr const a,
int  b 
)
inline

Definition at line 2441 of file z3++.h.

2441{ return ashr(a, a.ctx().num_val(b, a.get_sort())); }
expr ashr(expr const &a, expr const &b)
arithmetic shift right operator for bitvectors
Definition z3++.h:2440

◆ ashr() [3/3]

expr ashr ( int  a,
expr const b 
)
inline

Definition at line 2442 of file z3++.h.

2442{ return ashr(b.ctx().num_val(a, b.get_sort()), b); }

◆ atleast()

expr atleast ( expr_vector const es,
unsigned  bound 
)
inline

Definition at line 2662 of file z3++.h.

2662 {
2663 assert(es.size() > 0);
2664 context& ctx = es[0u].ctx();
2666 Z3_ast r = Z3_mk_atleast(ctx, _es.size(), _es.ptr(), bound);
2667 ctx.check_error();
2668 return expr(ctx, r);
2669 }
A Context manages all other Z3 objects, global configuration options, etc.
Definition z3++.h:191
Z3_error_code check_error() const
Auxiliary method used to check for API usage errors.
Definition z3++.h:241
Z3_ast Z3_API Z3_mk_atleast(Z3_context c, unsigned num_args, Z3_ast const args[], unsigned k)
Pseudo-Boolean relations.

◆ atmost()

expr atmost ( expr_vector const es,
unsigned  bound 
)
inline

Definition at line 2654 of file z3++.h.

2654 {
2655 assert(es.size() > 0);
2656 context& ctx = es[0u].ctx();
2658 Z3_ast r = Z3_mk_atmost(ctx, _es.size(), _es.ptr(), bound);
2659 ctx.check_error();
2660 return expr(ctx, r);
2661 }
Z3_ast Z3_API Z3_mk_atmost(Z3_context c, unsigned num_args, Z3_ast const args[], unsigned k)
Pseudo-Boolean relations.

◆ bv2int()

expr bv2int ( expr const a,
bool  is_signed 
)
inline

bit-vector and integer conversions.

Definition at line 2452 of file z3++.h.

2452{ Z3_ast r = Z3_mk_bv2int(a.ctx(), a, is_signed); a.check_error(); return expr(a.ctx(), r); }
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...

◆ bvadd_no_overflow()

expr bvadd_no_overflow ( expr const a,
expr const b,
bool  is_signed 
)
inline

bit-vector overflow/underflow checks

Definition at line 2458 of file z3++.h.

2458 {
2459 check_context(a, b); Z3_ast r = Z3_mk_bvadd_no_overflow(a.ctx(), a, b, is_signed); a.check_error(); return expr(a.ctx(), r);
2460 }
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.

◆ bvadd_no_underflow()

expr bvadd_no_underflow ( expr const a,
expr const b 
)
inline

Definition at line 2461 of file z3++.h.

2461 {
2462 check_context(a, b); Z3_ast r = Z3_mk_bvadd_no_underflow(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r);
2463 }
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.

◆ bvmul_no_overflow()

expr bvmul_no_overflow ( expr const a,
expr const b,
bool  is_signed 
)
inline

Definition at line 2476 of file z3++.h.

2476 {
2477 check_context(a, b); Z3_ast r = Z3_mk_bvmul_no_overflow(a.ctx(), a, b, is_signed); a.check_error(); return expr(a.ctx(), r);
2478 }
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.

◆ bvmul_no_underflow()

expr bvmul_no_underflow ( expr const a,
expr const b 
)
inline

Definition at line 2479 of file z3++.h.

2479 {
2480 check_context(a, b); Z3_ast r = Z3_mk_bvmul_no_underflow(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r);
2481 }
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...

◆ bvneg_no_overflow()

expr bvneg_no_overflow ( expr const a)
inline

Definition at line 2473 of file z3++.h.

2473 {
2474 Z3_ast r = Z3_mk_bvneg_no_overflow(a.ctx(), a); a.check_error(); return expr(a.ctx(), r);
2475 }
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.

◆ bvredand()

expr bvredand ( expr const a)
inline

Definition at line 2200 of file z3++.h.

2200 {
2201 assert(a.is_bv());
2202 Z3_ast r = Z3_mk_bvredand(a.ctx(), a);
2203 a.check_error();
2204 return expr(a.ctx(), r);
2205 }
Z3_ast Z3_API Z3_mk_bvredand(Z3_context c, Z3_ast t1)
Take conjunction of bits in vector, return vector of length 1.

◆ bvredor()

expr bvredor ( expr const a)
inline

Definition at line 2194 of file z3++.h.

2194 {
2195 assert(a.is_bv());
2196 Z3_ast r = Z3_mk_bvredor(a.ctx(), a);
2197 a.check_error();
2198 return expr(a.ctx(), r);
2199 }
Z3_ast Z3_API Z3_mk_bvredor(Z3_context c, Z3_ast t1)
Take disjunction of bits in vector, return vector of length 1.

◆ bvsdiv_no_overflow()

expr bvsdiv_no_overflow ( expr const a,
expr const b 
)
inline

Definition at line 2470 of file z3++.h.

2470 {
2471 check_context(a, b); Z3_ast r = Z3_mk_bvsdiv_no_overflow(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r);
2472 }
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.

◆ bvsub_no_overflow()

expr bvsub_no_overflow ( expr const a,
expr const b 
)
inline

Definition at line 2464 of file z3++.h.

2464 {
2465 check_context(a, b); Z3_ast r = Z3_mk_bvsub_no_overflow(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r);
2466 }
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.

◆ bvsub_no_underflow()

expr bvsub_no_underflow ( expr const a,
expr const b,
bool  is_signed 
)
inline

Definition at line 2467 of file z3++.h.

2467 {
2468 check_context(a, b); Z3_ast r = Z3_mk_bvsub_no_underflow(a.ctx(), a, b, is_signed); a.check_error(); return expr(a.ctx(), r);
2469 }
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.

◆ check_context()

void check_context ( object const a,
object const b 
)
inline

◆ concat() [1/2]

expr concat ( expr const a,
expr const b 
)
inline

Definition at line 2688 of file z3++.h.

2688 {
2689 check_context(a, b);
2690 Z3_ast r;
2691 if (Z3_is_seq_sort(a.ctx(), a.get_sort())) {
2692 Z3_ast _args[2] = { a, b };
2693 r = Z3_mk_seq_concat(a.ctx(), 2, _args);
2694 }
2695 else if (Z3_is_re_sort(a.ctx(), a.get_sort())) {
2696 Z3_ast _args[2] = { a, b };
2697 r = Z3_mk_re_concat(a.ctx(), 2, _args);
2698 }
2699 else {
2700 r = Z3_mk_concat(a.ctx(), a, b);
2701 }
2702 a.ctx().check_error();
2703 return expr(a.ctx(), r);
2704 }
bool Z3_API Z3_is_seq_sort(Z3_context c, Z3_sort s)
Check if s is a sequence sort.
Z3_ast Z3_API Z3_mk_seq_concat(Z3_context c, unsigned n, Z3_ast const args[])
Concatenate sequences.
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_concat(Z3_context c, Z3_ast t1, Z3_ast t2)
Concatenate the given bit-vectors.
bool Z3_API Z3_is_re_sort(Z3_context c, Z3_sort s)
Check if s is a regular expression sort.
System.IntPtr Z3_ast

◆ concat() [2/2]

expr concat ( expr_vector const args)
inline

Definition at line 2706 of file z3++.h.

2706 {
2707 Z3_ast r;
2708 assert(args.size() > 0);
2709 if (args.size() == 1) {
2710 return args[0u];
2711 }
2712 context& ctx = args[0u].ctx();
2713 array<Z3_ast> _args(args);
2714 if (Z3_is_seq_sort(ctx, args[0u].get_sort())) {
2715 r = Z3_mk_seq_concat(ctx, _args.size(), _args.ptr());
2716 }
2717 else if (Z3_is_re_sort(ctx, args[0u].get_sort())) {
2718 r = Z3_mk_re_concat(ctx, _args.size(), _args.ptr());
2719 }
2720 else {
2721 r = _args[args.size()-1];
2722 for (unsigned i = args.size()-1; i > 0; ) {
2723 --i;
2724 r = Z3_mk_concat(ctx, _args[i], r);
2725 ctx.check_error();
2726 }
2727 }
2728 ctx.check_error();
2729 return expr(ctx, r);
2730 }

◆ cond()

tactic cond ( probe const p,
tactic const t1,
tactic const t2 
)
inline

Definition at line 3830 of file z3++.h.

3830 {
3832 Z3_tactic r = Z3_tactic_cond(t1.ctx(), p, t1, t2);
3833 t1.check_error();
3834 return tactic(t1.ctx(), r);
3835 }
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...

◆ const_array()

expr const_array ( sort const d,
expr const v 
)
inline

Definition at line 4399 of file z3++.h.

4399 {
4401 }
Z3_ast Z3_API Z3_mk_const_array(Z3_context c, Z3_sort domain, Z3_ast v)
Create the constant array.
#define MK_EXPR2(_fn, _arg1, _arg2)
Definition z3++.h:4393

◆ disable_trace()

void disable_trace ( char const tag)
inline

Disable tracing messages tagged as tag when Z3 is compiled in debug mode. It is a NOOP otherwise.

Definition at line 112 of file z3++.h.

112 {
114 }
void Z3_API Z3_disable_trace(Z3_string tag)
Disable tracing messages tagged as tag when Z3 is compiled in debug mode. It is a NOOP otherwise.

◆ distinct()

expr distinct ( expr_vector const args)
inline

Definition at line 2679 of file z3++.h.

2679 {
2680 assert(args.size() > 0);
2681 context& ctx = args[0u].ctx();
2682 array<Z3_ast> _args(args);
2683 Z3_ast r = Z3_mk_distinct(ctx, _args.size(), _args.ptr());
2684 ctx.check_error();
2685 return expr(ctx, r);
2686 }
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]).

◆ empty()

expr empty ( sort const s)
inline

Definition at line 4503 of file z3++.h.

4503 {
4504 Z3_ast r = Z3_mk_seq_empty(s.ctx(), s);
4505 s.check_error();
4506 return expr(s.ctx(), r);
4507 }
Z3_ast Z3_API Z3_mk_seq_empty(Z3_context c, Z3_sort seq)
Create an empty sequence of the sequence sort seq.

◆ empty_set()

expr empty_set ( sort const s)
inline

Definition at line 4403 of file z3++.h.

4403 {
4405 }
Z3_ast Z3_API Z3_mk_empty_set(Z3_context c, Z3_sort domain)
Create the empty set.
#define MK_EXPR1(_fn, _arg)
Definition z3++.h:4388

◆ enable_trace()

void enable_trace ( char const tag)
inline

Enable tracing messages tagged as tag when Z3 is compiled in debug mode. It is a NOOP otherwise.

Definition at line 104 of file z3++.h.

104 {
106 }
void Z3_API Z3_enable_trace(Z3_string tag)
Enable tracing messages tagged as tag when Z3 is compiled in debug mode. It is a NOOP otherwise.

◆ eq()

bool eq ( ast const a,
ast const b 
)
inline

Definition at line 670 of file z3++.h.

670{ return Z3_is_eq_ast(a.ctx(), a, b); }
bool Z3_API Z3_is_eq_ast(Z3_context c, Z3_ast t1, Z3_ast t2)
Compare terms.

◆ exists() [1/5]

expr exists ( expr const x,
expr const b 
)
inline

Definition at line 2581 of file z3++.h.

2581 {
2582 check_context(x, b);
2583 Z3_app vars[] = {(Z3_app) x};
2584 Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 1, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);
2585 }
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.

◆ exists() [2/5]

expr exists ( expr const x1,
expr const x2,
expr const b 
)
inline

Definition at line 2586 of file z3++.h.

2586 {
2588 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};
2589 Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 2, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);
2590 }

◆ exists() [3/5]

expr exists ( expr const x1,
expr const x2,
expr const x3,
expr const b 
)
inline

Definition at line 2591 of file z3++.h.

2591 {
2593 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };
2594 Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 3, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);
2595 }

◆ exists() [4/5]

expr exists ( expr const x1,
expr const x2,
expr const x3,
expr const x4,
expr const b 
)
inline

Definition at line 2596 of file z3++.h.

2596 {
2598 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };
2599 Z3_ast r = Z3_mk_exists_const(b.ctx(), 0, 4, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);
2600 }

◆ exists() [5/5]

expr exists ( expr_vector const xs,
expr const b 
)
inline

Definition at line 2601 of file z3++.h.

2601 {
2602 array<Z3_app> vars(xs);
2603 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);
2604 }

◆ fail_if()

tactic fail_if ( probe const p)
inline

Definition at line 3819 of file z3++.h.

3819 {
3820 Z3_tactic r = Z3_tactic_fail_if(p.ctx(), p);
3821 p.check_error();
3822 return tactic(p.ctx(), r);
3823 }
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.

◆ finite_set_difference()

expr finite_set_difference ( expr const a,
expr const b 
)
inline

Definition at line 4471 of file z3++.h.

4471 {
4473 }
Z3_ast Z3_API Z3_mk_finite_set_difference(Z3_context c, Z3_ast s1, Z3_ast s2)
Create the set difference of two finite sets.

◆ finite_set_empty()

expr finite_set_empty ( sort const s)
inline

Definition at line 4453 of file z3++.h.

4453 {
4454 Z3_ast r = Z3_mk_finite_set_empty(s.ctx(), s);
4455 s.check_error();
4456 return expr(s.ctx(), r);
4457 }
Z3_ast Z3_API Z3_mk_finite_set_empty(Z3_context c, Z3_sort set_sort)
Create an empty finite set of the given sort.

◆ finite_set_filter()

expr finite_set_filter ( expr const f,
expr const s 
)
inline

Definition at line 4491 of file z3++.h.

4491 {
4493 }
Z3_ast Z3_API Z3_mk_finite_set_filter(Z3_context c, Z3_ast f, Z3_ast set)
Filter a finite set using a predicate.

◆ finite_set_intersect()

expr finite_set_intersect ( expr const a,
expr const b 
)
inline

Definition at line 4467 of file z3++.h.

4467 {
4469 }
Z3_ast Z3_API Z3_mk_finite_set_intersect(Z3_context c, Z3_ast s1, Z3_ast s2)
Create the intersection of two finite sets.

◆ finite_set_map()

expr finite_set_map ( expr const f,
expr const s 
)
inline

Definition at line 4487 of file z3++.h.

4487 {
4489 }
Z3_ast Z3_API Z3_mk_finite_set_map(Z3_context c, Z3_ast f, Z3_ast set)
Apply a function to all elements of a finite set.

◆ finite_set_member()

expr finite_set_member ( expr const e,
expr const s 
)
inline

Definition at line 4475 of file z3++.h.

4475 {
4477 }
Z3_ast Z3_API Z3_mk_finite_set_member(Z3_context c, Z3_ast elem, Z3_ast set)
Check if an element is a member of a finite set.

◆ finite_set_range()

expr finite_set_range ( expr const low,
expr const high 
)
inline

Definition at line 4495 of file z3++.h.

4495 {
4497 }
Z3_ast Z3_API Z3_mk_finite_set_range(Z3_context c, Z3_ast low, Z3_ast high)
Create a finite set of integers in the range [low, high].

◆ finite_set_singleton()

expr finite_set_singleton ( expr const e)
inline

Definition at line 4459 of file z3++.h.

4459 {
4461 }
Z3_ast Z3_API Z3_mk_finite_set_singleton(Z3_context c, Z3_ast elem)
Create a singleton finite set.

◆ finite_set_size()

expr finite_set_size ( expr const s)
inline

Definition at line 4479 of file z3++.h.

4479 {
4481 }
Z3_ast Z3_API Z3_mk_finite_set_size(Z3_context c, Z3_ast set)
Get the size (cardinality) of a finite set.

◆ finite_set_subset()

expr finite_set_subset ( expr const a,
expr const b 
)
inline

Definition at line 4483 of file z3++.h.

4483 {
4485 }
Z3_ast Z3_API Z3_mk_finite_set_subset(Z3_context c, Z3_ast s1, Z3_ast s2)
Check if one finite set is a subset of another.

◆ finite_set_union()

expr finite_set_union ( expr const a,
expr const b 
)
inline

Definition at line 4463 of file z3++.h.

4463 {
4465 }
Z3_ast Z3_API Z3_mk_finite_set_union(Z3_context c, Z3_ast s1, Z3_ast s2)
Create the union of two finite sets.

◆ fma()

expr fma ( expr const a,
expr const b,
expr const c,
expr const rm 
)
inline

Definition at line 2242 of file z3++.h.

2242 {
2244 assert(a.is_fpa() && b.is_fpa() && c.is_fpa());
2245 Z3_ast r = Z3_mk_fpa_fma(a.ctx(), rm, a, b, c);
2246 a.check_error();
2247 return expr(a.ctx(), r);
2248 }
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.

◆ foldl()

expr foldl ( expr const f,
expr const a,
expr const list 
)
inline

Definition at line 2746 of file z3++.h.

2746 {
2747 context& ctx = f.ctx();
2748 Z3_ast r = Z3_mk_seq_foldl(ctx, f, a, list);
2749 ctx.check_error();
2750 return expr(ctx, r);
2751 }
Z3_ast Z3_API Z3_mk_seq_foldl(Z3_context c, Z3_ast f, Z3_ast a, Z3_ast s)
Create a fold of the function f over the sequence s with accumulator a.

◆ foldli()

expr foldli ( expr const f,
expr const i,
expr const a,
expr const list 
)
inline

Definition at line 2753 of file z3++.h.

2753 {
2754 context& ctx = f.ctx();
2755 Z3_ast r = Z3_mk_seq_foldli(ctx, f, i, a, list);
2756 ctx.check_error();
2757 return expr(ctx, r);
2758 }
Z3_ast Z3_API Z3_mk_seq_foldli(Z3_context c, Z3_ast f, Z3_ast i, Z3_ast a, Z3_ast s)
Create a fold with index tracking of the function f over the sequence s with accumulator a starting a...

◆ forall() [1/5]

expr forall ( expr const x,
expr const b 
)
inline

Definition at line 2557 of file z3++.h.

2557 {
2558 check_context(x, b);
2559 Z3_app vars[] = {(Z3_app) x};
2560 Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 1, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);
2561 }
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.

◆ forall() [2/5]

expr forall ( expr const x1,
expr const x2,
expr const b 
)
inline

Definition at line 2562 of file z3++.h.

2562 {
2564 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};
2565 Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 2, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);
2566 }

◆ forall() [3/5]

expr forall ( expr const x1,
expr const x2,
expr const x3,
expr const b 
)
inline

Definition at line 2567 of file z3++.h.

2567 {
2569 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };
2570 Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 3, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);
2571 }

◆ forall() [4/5]

expr forall ( expr const x1,
expr const x2,
expr const x3,
expr const x4,
expr const b 
)
inline

Definition at line 2572 of file z3++.h.

2572 {
2574 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };
2575 Z3_ast r = Z3_mk_forall_const(b.ctx(), 0, 4, vars, 0, 0, b); b.check_error(); return expr(b.ctx(), r);
2576 }

◆ forall() [5/5]

expr forall ( expr_vector const xs,
expr const b 
)
inline

Definition at line 2577 of file z3++.h.

2577 {
2578 array<Z3_app> vars(xs);
2579 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);
2580 }

◆ fp_eq()

expr fp_eq ( expr const a,
expr const b 
)
inline

Definition at line 2233 of file z3++.h.

2233 {
2234 check_context(a, b);
2235 assert(a.is_fpa());
2236 Z3_ast r = Z3_mk_fpa_eq(a.ctx(), a, b);
2237 a.check_error();
2238 return expr(a.ctx(), r);
2239 }
Z3_ast Z3_API Z3_mk_fpa_eq(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point equality.

◆ fpa_fp()

expr fpa_fp ( expr const sgn,
expr const exp,
expr const sig 
)
inline

Definition at line 2250 of file z3++.h.

2250 {
2252 assert(sgn.is_bv() && exp.is_bv() && sig.is_bv());
2253 Z3_ast r = Z3_mk_fpa_fp(sgn.ctx(), sgn, exp, sig);
2254 sgn.check_error();
2255 return expr(sgn.ctx(), r);
2256 }
Z3_ast Z3_API Z3_mk_fpa_fp(Z3_context c, Z3_ast sgn, Z3_ast exp, Z3_ast sig)
Create an expression of FloatingPoint sort from three bit-vector expressions.

◆ fpa_to_fpa()

expr fpa_to_fpa ( expr const t,
sort  s 
)
inline

Definition at line 2286 of file z3++.h.

2286 {
2287 assert(t.is_fpa());
2288 Z3_ast r = Z3_mk_fpa_to_fp_float(t.ctx(), t.ctx().fpa_rounding_mode(), t, s);
2289 t.check_error();
2290 return expr(t.ctx(), r);
2291 }
Z3_ast Z3_API Z3_mk_fpa_to_fp_float(Z3_context c, Z3_ast rm, Z3_ast t, Z3_sort s)
Conversion of a FloatingPoint term into another term of different FloatingPoint sort.

◆ fpa_to_sbv()

expr fpa_to_sbv ( expr const t,
unsigned  sz 
)
inline

Definition at line 2258 of file z3++.h.

2258 {
2259 assert(t.is_fpa());
2260 Z3_ast r = Z3_mk_fpa_to_sbv(t.ctx(), t.ctx().fpa_rounding_mode(), t, sz);
2261 t.check_error();
2262 return expr(t.ctx(), r);
2263 }
Z3_ast Z3_API Z3_mk_fpa_to_sbv(Z3_context c, Z3_ast rm, Z3_ast t, unsigned sz)
Conversion of a floating-point term into a signed bit-vector.

◆ fpa_to_ubv()

expr fpa_to_ubv ( expr const t,
unsigned  sz 
)
inline

Definition at line 2265 of file z3++.h.

2265 {
2266 assert(t.is_fpa());
2267 Z3_ast r = Z3_mk_fpa_to_ubv(t.ctx(), t.ctx().fpa_rounding_mode(), t, sz);
2268 t.check_error();
2269 return expr(t.ctx(), r);
2270 }
Z3_ast Z3_API Z3_mk_fpa_to_ubv(Z3_context c, Z3_ast rm, Z3_ast t, unsigned sz)
Conversion of a floating-point term into an unsigned bit-vector.

◆ full_set()

expr full_set ( sort const s)
inline

Definition at line 4407 of file z3++.h.

4407 {
4409 }
Z3_ast Z3_API Z3_mk_full_set(Z3_context c, Z3_sort domain)
Create the full set.

◆ function() [1/9]

func_decl function ( char const name,
sort const d1,
sort const d2,
sort const d3,
sort const d4,
sort const d5,
sort const range 
)
inline

Definition at line 4309 of file z3++.h.

4309 {
4310 return range.ctx().function(name, d1, d2, d3, d4, d5, range);
4311 }
func_decl function(symbol const &name, unsigned arity, sort const *domain, sort const &range)
Definition z3++.h:4011
expr range(expr const &lo, expr const &hi)
Definition z3++.h:4575

◆ function() [2/9]

func_decl function ( char const name,
sort const d1,
sort const d2,
sort const d3,
sort const d4,
sort const range 
)
inline

Definition at line 4306 of file z3++.h.

4306 {
4307 return range.ctx().function(name, d1, d2, d3, d4, range);
4308 }

◆ function() [3/9]

func_decl function ( char const name,
sort const d1,
sort const d2,
sort const d3,
sort const range 
)
inline

Definition at line 4303 of file z3++.h.

4303 {
4304 return range.ctx().function(name, d1, d2, d3, range);
4305 }

◆ function() [4/9]

func_decl function ( char const name,
sort const d1,
sort const d2,
sort const range 
)
inline

Definition at line 4300 of file z3++.h.

4300 {
4301 return range.ctx().function(name, d1, d2, range);
4302 }

◆ function() [5/9]

func_decl function ( char const name,
sort const domain,
sort const range 
)
inline

Definition at line 4297 of file z3++.h.

4297 {
4298 return range.ctx().function(name, domain, range);
4299 }

◆ function() [6/9]

func_decl function ( char const name,
sort_vector const domain,
sort const range 
)
inline

Definition at line 4312 of file z3++.h.

4312 {
4313 return range.ctx().function(name, domain, range);
4314 }

◆ function() [7/9]

func_decl function ( char const name,
unsigned  arity,
sort const domain,
sort const range 
)
inline

Definition at line 4294 of file z3++.h.

4294 {
4295 return range.ctx().function(name, arity, domain, range);
4296 }

◆ function() [8/9]

func_decl function ( std::string const name,
sort_vector const domain,
sort const range 
)
inline

Definition at line 4315 of file z3++.h.

4315 {
4316 return range.ctx().function(name.c_str(), domain, range);
4317 }

◆ function() [9/9]

func_decl function ( symbol const name,
unsigned  arity,
sort const domain,
sort const range 
)
inline

Definition at line 4291 of file z3++.h.

4291 {
4292 return range.ctx().function(name, arity, domain, range);
4293 }

◆ get_full_version()

std::string get_full_version ( )
inline

Return a string that fully describes the version of Z3 in use.

Definition at line 96 of file z3++.h.

96 {
97 return std::string(Z3_get_full_version());
98 }
Z3_string Z3_API Z3_get_full_version(void)
Return a string that fully describes the version of Z3 in use.

◆ get_version()

void get_version ( unsigned &  major,
unsigned &  minor,
unsigned &  build_number,
unsigned &  revision_number 
)
inline

Return Z3 version number information.

Definition at line 89 of file z3++.h.

89 {
91 }
void Z3_API Z3_get_version(unsigned *major, unsigned *minor, unsigned *build_number, unsigned *revision_number)
Return Z3 version number information.

◆ implies() [1/3]

expr implies ( bool  a,
expr const b 
)
inline

Definition at line 1845 of file z3++.h.

1845{ return implies(b.ctx().bool_val(a), b); }
expr implies(expr const &a, expr const &b)
Definition z3++.h:1840

◆ implies() [2/3]

expr implies ( expr const a,
bool  b 
)
inline

Definition at line 1844 of file z3++.h.

1844{ return implies(a, a.ctx().bool_val(b)); }

◆ implies() [3/3]

expr implies ( expr const a,
expr const b 
)
inline

Definition at line 1840 of file z3++.h.

1840 {
1841 assert(a.is_bool() && b.is_bool());
1843 }
Z3_ast Z3_API Z3_mk_implies(Z3_context c, Z3_ast t1, Z3_ast t2)
Create an AST node representing t1 implies t2.
#define _Z3_MK_BIN_(a, b, binop)
Definition z3++.h:1833

◆ in_re()

expr in_re ( expr const s,
expr const re 
)
inline

Definition at line 4535 of file z3++.h.

4535 {
4537 }
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.

◆ indexof()

expr indexof ( expr const s,
expr const substr,
expr const offset 
)
inline

Definition at line 4520 of file z3++.h.

4520 {
4522 Z3_ast r = Z3_mk_seq_index(s.ctx(), s, substr, offset);
4523 s.check_error();
4524 return expr(s.ctx(), r);
4525 }
Z3_ast Z3_API Z3_mk_seq_index(Z3_context c, Z3_ast s, Z3_ast substr, Z3_ast offset)
Return index of the first occurrence of substr in s starting from offset offset. If s does not contai...

◆ int2bv()

expr int2bv ( unsigned  n,
expr const a 
)
inline

Definition at line 2453 of file z3++.h.

2453{ Z3_ast r = Z3_mk_int2bv(a.ctx(), n, a); a.check_error(); return expr(a.ctx(), r); }
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.

◆ is_int()

expr is_int ( expr const e)
inline

Definition at line 1888 of file z3++.h.

1888{ _Z3_MK_UN_(e, Z3_mk_is_int); }
Z3_ast Z3_API Z3_mk_is_int(Z3_context c, Z3_ast t1)
Check if a real number is an integer.
#define _Z3_MK_UN_(a, mkun)
Definition z3++.h:1880

◆ ite()

expr ite ( expr const c,
expr const t,
expr const e 
)
inline

Create the if-then-else expression ite(c, t, e)

Precondition
c.is_bool()

Definition at line 2305 of file z3++.h.

2305 {
2306 check_context(c, t); check_context(c, e);
2307 assert(c.is_bool());
2308 Z3_ast r = Z3_mk_ite(c.ctx(), c, t, e);
2309 c.check_error();
2310 return expr(c.ctx(), r);
2311 }

◆ lambda() [1/5]

expr lambda ( expr const x,
expr const b 
)
inline

Definition at line 2605 of file z3++.h.

2605 {
2606 check_context(x, b);
2607 Z3_app vars[] = {(Z3_app) x};
2608 Z3_ast r = Z3_mk_lambda_const(b.ctx(), 1, vars, b); b.check_error(); return expr(b.ctx(), r);
2609 }
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.

◆ lambda() [2/5]

expr lambda ( expr const x1,
expr const x2,
expr const b 
)
inline

Definition at line 2610 of file z3++.h.

2610 {
2612 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2};
2613 Z3_ast r = Z3_mk_lambda_const(b.ctx(), 2, vars, b); b.check_error(); return expr(b.ctx(), r);
2614 }

◆ lambda() [3/5]

expr lambda ( expr const x1,
expr const x2,
expr const x3,
expr const b 
)
inline

Definition at line 2615 of file z3++.h.

2615 {
2617 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3 };
2618 Z3_ast r = Z3_mk_lambda_const(b.ctx(), 3, vars, b); b.check_error(); return expr(b.ctx(), r);
2619 }

◆ lambda() [4/5]

expr lambda ( expr const x1,
expr const x2,
expr const x3,
expr const x4,
expr const b 
)
inline

Definition at line 2620 of file z3++.h.

2620 {
2622 Z3_app vars[] = {(Z3_app) x1, (Z3_app) x2, (Z3_app) x3, (Z3_app) x4 };
2623 Z3_ast r = Z3_mk_lambda_const(b.ctx(), 4, vars, b); b.check_error(); return expr(b.ctx(), r);
2624 }

◆ lambda() [5/5]

expr lambda ( expr_vector const xs,
expr const b 
)
inline

Definition at line 2625 of file z3++.h.

2625 {
2626 array<Z3_app> vars(xs);
2627 Z3_ast r = Z3_mk_lambda_const(b.ctx(), vars.size(), vars.ptr(), b); b.check_error(); return expr(b.ctx(), r);
2628 }

◆ last_indexof()

expr last_indexof ( expr const s,
expr const substr 
)
inline

Definition at line 4526 of file z3++.h.

4526 {
4527 check_context(s, substr);
4528 Z3_ast r = Z3_mk_seq_last_index(s.ctx(), s, substr);
4529 s.check_error();
4530 return expr(s.ctx(), r);
4531 }
Z3_ast Z3_API Z3_mk_seq_last_index(Z3_context c, Z3_ast s, Z3_ast substr)
Return index of the last occurrence of substr in s. If s does not contain substr, then the value is -...

◆ linear_order()

func_decl linear_order ( sort const a,
unsigned  index 
)
inline

Definition at line 2489 of file z3++.h.

2489 {
2490 return to_func_decl(a.ctx(), Z3_mk_linear_order(a.ctx(), a, index));
2491 }
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.
func_decl to_func_decl(context &c, Z3_func_decl f)
Definition z3++.h:2332

◆ lshr() [1/3]

expr lshr ( expr const a,
expr const b 
)
inline

logic shift right operator for bitvectors

Definition at line 2433 of file z3++.h.

2433{ return to_expr(a.ctx(), Z3_mk_bvlshr(a.ctx(), a, b)); }
Z3_ast Z3_API Z3_mk_bvlshr(Z3_context c, Z3_ast t1, Z3_ast t2)
Logical shift right.

Referenced by lshr(), and lshr().

◆ lshr() [2/3]

expr lshr ( expr const a,
int  b 
)
inline

Definition at line 2434 of file z3++.h.

2434{ return lshr(a, a.ctx().num_val(b, a.get_sort())); }
expr lshr(expr const &a, expr const &b)
logic shift right operator for bitvectors
Definition z3++.h:2433

◆ lshr() [3/3]

expr lshr ( int  a,
expr const b 
)
inline

Definition at line 2435 of file z3++.h.

2435{ return lshr(b.ctx().num_val(a, b.get_sort()), b); }

◆ map()

expr map ( expr const f,
expr const list 
)
inline

Definition at line 2732 of file z3++.h.

2732 {
2733 context& ctx = f.ctx();
2734 Z3_ast r = Z3_mk_seq_map(ctx, f, list);
2735 ctx.check_error();
2736 return expr(ctx, r);
2737 }
Z3_ast Z3_API Z3_mk_seq_map(Z3_context c, Z3_ast f, Z3_ast s)
Create a map of the function f over the sequence s.

Referenced by qe_model_project_skolem(), and qe_model_project_with_witness().

◆ mapi()

expr mapi ( expr const f,
expr const i,
expr const list 
)
inline

Definition at line 2739 of file z3++.h.

2739 {
2740 context& ctx = f.ctx();
2741 Z3_ast r = Z3_mk_seq_mapi(ctx, f, i, list);
2742 ctx.check_error();
2743 return expr(ctx, r);
2744 }
Z3_ast Z3_API Z3_mk_seq_mapi(Z3_context c, Z3_ast f, Z3_ast i, Z3_ast s)
Create a map of the function f over the sequence s starting at index i.

◆ max()

expr max ( expr const a,
expr const b 
)
inline

Definition at line 2178 of file z3++.h.

2178 {
2179 check_context(a, b);
2180 Z3_ast r;
2181 if (a.is_arith()) {
2182 r = Z3_mk_ite(a.ctx(), Z3_mk_ge(a.ctx(), a, b), a, b);
2183 }
2184 else if (a.is_bv()) {
2185 r = Z3_mk_ite(a.ctx(), Z3_mk_bvuge(a.ctx(), a, b), a, b);
2186 }
2187 else {
2188 assert(a.is_fpa());
2189 r = Z3_mk_fpa_max(a.ctx(), a, b);
2190 }
2191 a.check_error();
2192 return expr(a.ctx(), r);
2193 }
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_fpa_max(Z3_context c, Z3_ast t1, Z3_ast t2)
Maximum of floating-point numbers.
Z3_ast Z3_API Z3_mk_bvuge(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned greater than or equal to.

◆ min()

expr min ( expr const a,
expr const b 
)
inline

Definition at line 2162 of file z3++.h.

2162 {
2163 check_context(a, b);
2164 Z3_ast r;
2165 if (a.is_arith()) {
2166 r = Z3_mk_ite(a.ctx(), Z3_mk_ge(a.ctx(), a, b), b, a);
2167 }
2168 else if (a.is_bv()) {
2169 r = Z3_mk_ite(a.ctx(), Z3_mk_bvuge(a.ctx(), a, b), b, a);
2170 }
2171 else {
2172 assert(a.is_fpa());
2173 r = Z3_mk_fpa_min(a.ctx(), a, b);
2174 }
2175 a.check_error();
2176 return expr(a.ctx(), r);
2177 }
Z3_ast Z3_API Z3_mk_fpa_min(Z3_context c, Z3_ast t1, Z3_ast t2)
Minimum of floating-point numbers.

◆ mk_and()

expr mk_and ( expr_vector const args)
inline

Definition at line 2766 of file z3++.h.

2766 {
2767 array<Z3_ast> _args(args);
2768 Z3_ast r = Z3_mk_and(args.ctx(), _args.size(), _args.ptr());
2769 args.check_error();
2770 return expr(args.ctx(), r);
2771 }
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].

◆ mk_or()

expr mk_or ( expr_vector const args)
inline

Definition at line 2760 of file z3++.h.

2760 {
2761 array<Z3_ast> _args(args);
2762 Z3_ast r = Z3_mk_or(args.ctx(), _args.size(), _args.ptr());
2763 args.check_error();
2764 return expr(args.ctx(), r);
2765 }
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].

◆ mk_xor()

expr mk_xor ( expr_vector const args)
inline

Definition at line 2772 of file z3++.h.

2772 {
2773 if (args.empty())
2774 return args.ctx().bool_val(false);
2775 expr r = args[0u];
2776 for (unsigned i = 1; i < args.size(); ++i)
2777 r = r ^ args[i];
2778 return r;
2779 }

◆ mod() [1/3]

expr mod ( expr const a,
expr const b 
)
inline

Definition at line 1852 of file z3++.h.

1852 {
1853 if (a.is_bv()) {
1855 }
1856 else {
1857 _Z3_MK_BIN_(a, b, Z3_mk_mod);
1858 }
1859 }
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_bvsmod(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed remainder (sign follows divisor).

Referenced by operator%(), operator%(), and operator%().

◆ mod() [2/3]

expr mod ( expr const a,
int  b 
)
inline

Definition at line 1860 of file z3++.h.

1860{ return mod(a, a.ctx().num_val(b, a.get_sort())); }
expr mod(expr const &a, expr const &b)
Definition z3++.h:1852

◆ mod() [3/3]

expr mod ( int  a,
expr const b 
)
inline

Definition at line 1861 of file z3++.h.

1861{ return mod(b.ctx().num_val(a, b.get_sort()), b); }

◆ nand()

expr nand ( expr const a,
expr const b 
)
inline

Definition at line 2159 of file z3++.h.

2159{ if (a.is_bool()) return !(a && b); check_context(a, b); Z3_ast r = Z3_mk_bvnand(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r); }
Z3_ast Z3_API Z3_mk_bvnand(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise nand.

◆ nor()

expr nor ( expr const a,
expr const b 
)
inline

Definition at line 2160 of file z3++.h.

2160{ if (a.is_bool()) return !(a || b); check_context(a, b); Z3_ast r = Z3_mk_bvnor(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r); }
Z3_ast Z3_API Z3_mk_bvnor(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise nor.

◆ operator!() [1/2]

expr operator! ( expr const a)
inline
Precondition
a.is_bool()

Definition at line 1886 of file z3++.h.

1886{ assert(a.is_bool()); _Z3_MK_UN_(a, Z3_mk_not); }
Z3_ast Z3_API Z3_mk_not(Z3_context c, Z3_ast a)
Create an AST node representing not(a).

◆ operator!() [2/2]

probe operator! ( probe const p)
inline

Definition at line 3625 of file z3++.h.

3625 {
3626 Z3_probe r = Z3_probe_not(p.ctx(), p); p.check_error(); return probe(p.ctx(), r);
3627 }
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.

◆ operator!=() [1/5]

expr operator!= ( double  a,
expr const b 
)
inline

Definition at line 1938 of file z3++.h.

1938{ assert(b.is_fpa()); return b.ctx().fpa_val(a) != b; }

◆ operator!=() [2/5]

expr operator!= ( expr const a,
double  b 
)
inline

Definition at line 1937 of file z3++.h.

1937{ assert(a.is_fpa()); return a != a.ctx().fpa_val(b); }

◆ operator!=() [3/5]

expr operator!= ( expr const a,
expr const b 
)
inline

Definition at line 1928 of file z3++.h.

1928 {
1929 check_context(a, b);
1930 Z3_ast args[2] = { a, b };
1931 Z3_ast r = Z3_mk_distinct(a.ctx(), 2, args);
1932 a.check_error();
1933 return expr(a.ctx(), r);
1934 }

◆ operator!=() [4/5]

expr operator!= ( expr const a,
int  b 
)
inline

Definition at line 1935 of file z3++.h.

1935{ assert(a.is_arith() || a.is_bv() || a.is_fpa()); return a != a.ctx().num_val(b, a.get_sort()); }

◆ operator!=() [5/5]

expr operator!= ( int  a,
expr const b 
)
inline

Definition at line 1936 of file z3++.h.

1936{ assert(b.is_arith() || b.is_bv() || b.is_fpa()); return b.ctx().num_val(a, b.get_sort()) != b; }

◆ operator%() [1/3]

expr operator% ( expr const a,
expr const b 
)
inline

Definition at line 1863 of file z3++.h.

1863{ return mod(a, b); }

◆ operator%() [2/3]

expr operator% ( expr const a,
int  b 
)
inline

Definition at line 1864 of file z3++.h.

1864{ return mod(a, b); }

◆ operator%() [3/3]

expr operator% ( int  a,
expr const b 
)
inline

Definition at line 1865 of file z3++.h.

1865{ return mod(a, b); }

◆ operator&() [1/5]

expr operator& ( expr const a,
expr const b 
)
inline

Definition at line 2147 of file z3++.h.

2147{ if (a.is_bool()) return a && b; check_context(a, b); Z3_ast r = Z3_mk_bvand(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r); }
Z3_ast Z3_API Z3_mk_bvand(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise and.

◆ operator&() [2/5]

expr operator& ( expr const a,
int  b 
)
inline

Definition at line 2148 of file z3++.h.

2148{ return a & a.ctx().num_val(b, a.get_sort()); }

◆ operator&() [3/5]

expr operator& ( int  a,
expr const b 
)
inline

Definition at line 2149 of file z3++.h.

2149{ return b.ctx().num_val(a, b.get_sort()) & b; }

◆ operator&() [4/5]

simplifier operator& ( simplifier const t1,
simplifier const t2 
)
inline

Definition at line 3539 of file z3++.h.

3539 {
3541 Z3_simplifier r = Z3_simplifier_and_then(t1.ctx(), t1, t2);
3542 t1.check_error();
3543 return simplifier(t1.ctx(), r);
3544 }
Z3_simplifier Z3_API Z3_simplifier_and_then(Z3_context c, Z3_simplifier t1, Z3_simplifier t2)
Return a simplifier that applies t1 to a given goal and t2 to every subgoal produced by t1.

◆ operator&() [5/5]

tactic operator& ( tactic const t1,
tactic const t2 
)
inline

Definition at line 3465 of file z3++.h.

3465 {
3467 Z3_tactic r = Z3_tactic_and_then(t1.ctx(), t1, t2);
3468 t1.check_error();
3469 return tactic(t1.ctx(), r);
3470 }
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.

◆ operator&&() [1/4]

expr operator&& ( bool  a,
expr const b 
)
inline
Precondition
b.is_bool()

Definition at line 1902 of file z3++.h.

1902{ return b.ctx().bool_val(a) && b; }

◆ operator&&() [2/4]

expr operator&& ( expr const a,
bool  b 
)
inline
Precondition
a.is_bool()

Definition at line 1901 of file z3++.h.

1901{ return a && a.ctx().bool_val(b); }

◆ operator&&() [3/4]

expr operator&& ( expr const a,
expr const b 
)
inline
Precondition
a.is_bool()
b.is_bool()

Definition at line 1892 of file z3++.h.

1892 {
1893 check_context(a, b);
1894 assert(a.is_bool() && b.is_bool());
1895 Z3_ast args[2] = { a, b };
1896 Z3_ast r = Z3_mk_and(a.ctx(), 2, args);
1897 a.check_error();
1898 return expr(a.ctx(), r);
1899 }

◆ operator&&() [4/4]

probe operator&& ( probe const p1,
probe const p2 
)
inline

Definition at line 3619 of file z3++.h.

3619 {
3620 check_context(p1, p2); Z3_probe r = Z3_probe_and(p1.ctx(), p1, p2); p1.check_error(); return probe(p1.ctx(), r);
3621 }
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.

◆ operator*() [1/3]

expr operator* ( expr const a,
expr const b 
)
inline

Definition at line 1970 of file z3++.h.

1970 {
1971 check_context(a, b);
1972 Z3_ast r = 0;
1973 if (a.is_arith() && b.is_arith()) {
1974 Z3_ast args[2] = { a, b };
1975 r = Z3_mk_mul(a.ctx(), 2, args);
1976 }
1977 else if (a.is_bv() && b.is_bv()) {
1978 r = Z3_mk_bvmul(a.ctx(), a, b);
1979 }
1980 else if (a.is_fpa() && b.is_fpa()) {
1981 r = Z3_mk_fpa_mul(a.ctx(), a.ctx().fpa_rounding_mode(), a, b);
1982 }
1983 else {
1984 // operator is not supported by given arguments.
1985 assert(false);
1986 }
1987 a.check_error();
1988 return expr(a.ctx(), r);
1989 }
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_bvmul(Z3_context c, Z3_ast t1, Z3_ast t2)
Standard two's complement multiplication.
Z3_ast Z3_API Z3_mk_fpa_mul(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2)
Floating-point multiplication.

◆ operator*() [2/3]

expr operator* ( expr const a,
int  b 
)
inline

Definition at line 1990 of file z3++.h.

1990{ return a * a.ctx().num_val(b, a.get_sort()); }

◆ operator*() [3/3]

expr operator* ( int  a,
expr const b 
)
inline

Definition at line 1991 of file z3++.h.

1991{ return b.ctx().num_val(a, b.get_sort()) * b; }

◆ operator+() [1/3]

expr operator+ ( expr const a,
expr const b 
)
inline

Definition at line 1940 of file z3++.h.

1940 {
1941 check_context(a, b);
1942 Z3_ast r = 0;
1943 if (a.is_arith() && b.is_arith()) {
1944 Z3_ast args[2] = { a, b };
1945 r = Z3_mk_add(a.ctx(), 2, args);
1946 }
1947 else if (a.is_bv() && b.is_bv()) {
1948 r = Z3_mk_bvadd(a.ctx(), a, b);
1949 }
1950 else if (a.is_seq() && b.is_seq()) {
1951 return concat(a, b);
1952 }
1953 else if (a.is_re() && b.is_re()) {
1954 Z3_ast _args[2] = { a, b };
1955 r = Z3_mk_re_union(a.ctx(), 2, _args);
1956 }
1957 else if (a.is_fpa() && b.is_fpa()) {
1958 r = Z3_mk_fpa_add(a.ctx(), a.ctx().fpa_rounding_mode(), a, b);
1959 }
1960 else {
1961 // operator is not supported by given arguments.
1962 assert(false);
1963 }
1964 a.check_error();
1965 return expr(a.ctx(), r);
1966 }
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_bvadd(Z3_context c, Z3_ast t1, Z3_ast t2)
Standard two's complement addition.
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_add(Z3_context c, unsigned num_args, Z3_ast const args[])
Create an AST node representing args[0] + ... + args[num_args-1].
expr concat(expr const &a, expr const &b)
Definition z3++.h:2688

◆ operator+() [2/3]

expr operator+ ( expr const a,
int  b 
)
inline

Definition at line 1967 of file z3++.h.

1967{ return a + a.ctx().num_val(b, a.get_sort()); }

◆ operator+() [3/3]

expr operator+ ( int  a,
expr const b 
)
inline

Definition at line 1968 of file z3++.h.

1968{ return b.ctx().num_val(a, b.get_sort()) + b; }

◆ operator-() [1/4]

expr operator- ( expr const a)
inline

Definition at line 2036 of file z3++.h.

2036 {
2037 Z3_ast r = 0;
2038 if (a.is_arith()) {
2039 r = Z3_mk_unary_minus(a.ctx(), a);
2040 }
2041 else if (a.is_bv()) {
2042 r = Z3_mk_bvneg(a.ctx(), a);
2043 }
2044 else if (a.is_fpa()) {
2045 r = Z3_mk_fpa_neg(a.ctx(), a);
2046 }
2047 else {
2048 // operator is not supported by given arguments.
2049 assert(false);
2050 }
2051 a.check_error();
2052 return expr(a.ctx(), r);
2053 }
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_fpa_neg(Z3_context c, Z3_ast t)
Floating-point negation.
Z3_ast Z3_API Z3_mk_bvneg(Z3_context c, Z3_ast t1)
Standard two's complement unary minus.

◆ operator-() [2/4]

expr operator- ( expr const a,
expr const b 
)
inline

Definition at line 2055 of file z3++.h.

2055 {
2056 check_context(a, b);
2057 Z3_ast r = 0;
2058 if (a.is_arith() && b.is_arith()) {
2059 Z3_ast args[2] = { a, b };
2060 r = Z3_mk_sub(a.ctx(), 2, args);
2061 }
2062 else if (a.is_bv() && b.is_bv()) {
2063 r = Z3_mk_bvsub(a.ctx(), a, b);
2064 }
2065 else if (a.is_fpa() && b.is_fpa()) {
2066 r = Z3_mk_fpa_sub(a.ctx(), a.ctx().fpa_rounding_mode(), a, b);
2067 }
2068 else {
2069 // operator is not supported by given arguments.
2070 assert(false);
2071 }
2072 a.check_error();
2073 return expr(a.ctx(), r);
2074 }
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_bvsub(Z3_context c, Z3_ast t1, Z3_ast t2)
Standard two's complement subtraction.
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].

◆ operator-() [3/4]

expr operator- ( expr const a,
int  b 
)
inline

Definition at line 2075 of file z3++.h.

2075{ return a - a.ctx().num_val(b, a.get_sort()); }

◆ operator-() [4/4]

expr operator- ( int  a,
expr const b 
)
inline

Definition at line 2076 of file z3++.h.

2076{ return b.ctx().num_val(a, b.get_sort()) - b; }

◆ operator/() [1/3]

expr operator/ ( expr const a,
expr const b 
)
inline

Definition at line 2014 of file z3++.h.

2014 {
2015 check_context(a, b);
2016 Z3_ast r = 0;
2017 if (a.is_arith() && b.is_arith()) {
2018 r = Z3_mk_div(a.ctx(), a, b);
2019 }
2020 else if (a.is_bv() && b.is_bv()) {
2021 r = Z3_mk_bvsdiv(a.ctx(), a, b);
2022 }
2023 else if (a.is_fpa() && b.is_fpa()) {
2024 r = Z3_mk_fpa_div(a.ctx(), a.ctx().fpa_rounding_mode(), a, b);
2025 }
2026 else {
2027 // operator is not supported by given arguments.
2028 assert(false);
2029 }
2030 a.check_error();
2031 return expr(a.ctx(), r);
2032 }
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_ast Z3_API Z3_mk_bvsdiv(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed division.
Z3_ast Z3_API Z3_mk_fpa_div(Z3_context c, Z3_ast rm, Z3_ast t1, Z3_ast t2)
Floating-point division.

◆ operator/() [2/3]

expr operator/ ( expr const a,
int  b 
)
inline

Definition at line 2033 of file z3++.h.

2033{ return a / a.ctx().num_val(b, a.get_sort()); }

◆ operator/() [3/3]

expr operator/ ( int  a,
expr const b 
)
inline

Definition at line 2034 of file z3++.h.

2034{ return b.ctx().num_val(a, b.get_sort()) / b; }

◆ operator<() [1/6]

probe operator< ( double  p1,
probe const p2 
)
inline

Definition at line 3608 of file z3++.h.

3608{ return probe(p2.ctx(), p1) < p2; }

◆ operator<() [2/6]

expr operator< ( expr const a,
expr const b 
)
inline

Definition at line 2103 of file z3++.h.

2103 {
2104 check_context(a, b);
2105 Z3_ast r = 0;
2106 if (a.is_arith() && b.is_arith()) {
2107 r = Z3_mk_lt(a.ctx(), a, b);
2108 }
2109 else if (a.is_bv() && b.is_bv()) {
2110 r = Z3_mk_bvslt(a.ctx(), a, b);
2111 }
2112 else if (a.is_fpa() && b.is_fpa()) {
2113 r = Z3_mk_fpa_lt(a.ctx(), a, b);
2114 }
2115 else {
2116 // operator is not supported by given arguments.
2117 assert(false);
2118 }
2119 a.check_error();
2120 return expr(a.ctx(), r);
2121 }
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_lt(Z3_context c, Z3_ast t1, Z3_ast t2)
Create less than.
Z3_ast Z3_API Z3_mk_fpa_lt(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point less than.

◆ operator<() [3/6]

expr operator< ( expr const a,
int  b 
)
inline

Definition at line 2122 of file z3++.h.

2122{ return a < a.ctx().num_val(b, a.get_sort()); }

◆ operator<() [4/6]

expr operator< ( int  a,
expr const b 
)
inline

Definition at line 2123 of file z3++.h.

2123{ return b.ctx().num_val(a, b.get_sort()) < b; }

◆ operator<() [5/6]

probe operator< ( probe const p1,
double  p2 
)
inline

Definition at line 3607 of file z3++.h.

3607{ return p1 < probe(p1.ctx(), p2); }

◆ operator<() [6/6]

probe operator< ( probe const p1,
probe const p2 
)
inline

Definition at line 3604 of file z3++.h.

3604 {
3605 check_context(p1, p2); Z3_probe r = Z3_probe_lt(p1.ctx(), p1, p2); p1.check_error(); return probe(p1.ctx(), r);
3606 }
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...

◆ operator<<() [1/13]

std::ostream & operator<< ( std::ostream &  out,
apply_result const r 
)
inline

Definition at line 3423 of file z3++.h.

3423{ out << Z3_apply_result_to_string(r.ctx(), r); return out; }
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.

◆ operator<<() [2/13]

std::ostream & operator<< ( std::ostream &  out,
ast const n 
)
inline

Definition at line 666 of file z3++.h.

666 {
667 out << Z3_ast_to_string(n.ctx(), n.m_ast); return out;
668 }
Z3_string Z3_API Z3_ast_to_string(Z3_context c, Z3_ast a)
Convert the given AST node into a string.

◆ operator<<() [3/13]

std::ostream & operator<< ( std::ostream &  out,
check_result  r 
)
inline

Definition at line 3019 of file z3++.h.

3019 {
3020 if (r == unsat) out << "unsat";
3021 else if (r == sat) out << "sat";
3022 else out << "unknown";
3023 return out;
3024 }

◆ operator<<() [4/13]

std::ostream & operator<< ( std::ostream &  out,
exception const e 
)
inline

Definition at line 128 of file z3++.h.

128{ out << e.msg(); return out; }

◆ operator<<() [5/13]

std::ostream & operator<< ( std::ostream &  out,
fixedpoint const f 
)
inline

Definition at line 3817 of file z3++.h.

3817{ return out << Z3_fixedpoint_to_string(f.ctx(), f, 0, 0); }
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.

◆ operator<<() [6/13]

std::ostream & operator<< ( std::ostream &  out,
goal const g 
)
inline

Definition at line 3399 of file z3++.h.

3399{ out << Z3_goal_to_string(g.ctx(), g); return out; }
Z3_string Z3_API Z3_goal_to_string(Z3_context c, Z3_goal g)
Convert a goal into a string.

◆ operator<<() [7/13]

std::ostream & operator<< ( std::ostream &  out,
model const m 
)
inline

Definition at line 2987 of file z3++.h.

2987{ return out << m.to_string(); }

◆ operator<<() [8/13]

std::ostream & operator<< ( std::ostream &  out,
optimize const s 
)
inline

Definition at line 3759 of file z3++.h.

3759{ out << Z3_optimize_to_string(s.ctx(), s.m_opt); return out; }
Z3_string Z3_API Z3_optimize_to_string(Z3_context c, Z3_optimize o)
Print the current context as a string.

◆ operator<<() [9/13]

std::ostream & operator<< ( std::ostream &  out,
param_descrs const d 
)
inline

Definition at line 609 of file z3++.h.

609{ return out << d.to_string(); }

◆ operator<<() [10/13]

std::ostream & operator<< ( std::ostream &  out,
params const p 
)
inline

Definition at line 633 of file z3++.h.

633 {
634 out << Z3_params_to_string(p.ctx(), p); return out;
635 }
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...

◆ operator<<() [11/13]

std::ostream & operator<< ( std::ostream &  out,
solver const s 
)
inline

Definition at line 3340 of file z3++.h.

3340{ out << Z3_solver_to_string(s.ctx(), s); return out; }
Z3_string Z3_API Z3_solver_to_string(Z3_context c, Z3_solver s)
Convert a solver into a string.

◆ operator<<() [12/13]

std::ostream & operator<< ( std::ostream &  out,
stats const s 
)
inline

Definition at line 3016 of file z3++.h.

3016{ out << Z3_stats_to_string(s.ctx(), s); return out; }
Z3_string Z3_API Z3_stats_to_string(Z3_context c, Z3_stats s)
Convert a statistics into a string.

◆ operator<<() [13/13]

std::ostream & operator<< ( std::ostream &  out,
symbol const s 
)
inline

Definition at line 577 of file z3++.h.

577 {
578 if (s.kind() == Z3_INT_SYMBOL)
579 out << "k!" << s.to_int();
580 else
581 out << s.str();
582 return out;
583 }
@ Z3_INT_SYMBOL
Definition z3_api.h:73

◆ operator<=() [1/6]

probe operator<= ( double  p1,
probe const p2 
)
inline

Definition at line 3598 of file z3++.h.

3598{ return probe(p2.ctx(), p1) <= p2; }

◆ operator<=() [2/6]

expr operator<= ( expr const a,
expr const b 
)
inline

Definition at line 2078 of file z3++.h.

2078 {
2079 check_context(a, b);
2080 Z3_ast r = 0;
2081 if (a.is_arith() && b.is_arith()) {
2082 r = Z3_mk_le(a.ctx(), a, b);
2083 }
2084 else if (a.is_bv() && b.is_bv()) {
2085 r = Z3_mk_bvsle(a.ctx(), a, b);
2086 }
2087 else if (a.is_fpa() && b.is_fpa()) {
2088 r = Z3_mk_fpa_leq(a.ctx(), a, b);
2089 }
2090 else {
2091 // operator is not supported by given arguments.
2092 assert(false);
2093 }
2094 a.check_error();
2095 return expr(a.ctx(), r);
2096 }
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_le(Z3_context c, Z3_ast t1, Z3_ast t2)
Create less than or equal to.
Z3_ast Z3_API Z3_mk_fpa_leq(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point less than or equal.

◆ operator<=() [3/6]

expr operator<= ( expr const a,
int  b 
)
inline

Definition at line 2097 of file z3++.h.

2097{ return a <= a.ctx().num_val(b, a.get_sort()); }

◆ operator<=() [4/6]

expr operator<= ( int  a,
expr const b 
)
inline

Definition at line 2098 of file z3++.h.

2098{ return b.ctx().num_val(a, b.get_sort()) <= b; }

◆ operator<=() [5/6]

probe operator<= ( probe const p1,
double  p2 
)
inline

Definition at line 3597 of file z3++.h.

3597{ return p1 <= probe(p1.ctx(), p2); }

◆ operator<=() [6/6]

probe operator<= ( probe const p1,
probe const p2 
)
inline

Definition at line 3594 of file z3++.h.

3594 {
3595 check_context(p1, p2); Z3_probe r = Z3_probe_le(p1.ctx(), p1, p2); p1.check_error(); return probe(p1.ctx(), r);
3596 }
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...

◆ operator==() [1/8]

expr operator== ( double  a,
expr const b 
)
inline

Definition at line 1926 of file z3++.h.

1926{ assert(b.is_fpa()); return b.ctx().fpa_val(a) == b; }

◆ operator==() [2/8]

probe operator== ( double  p1,
probe const p2 
)
inline

Definition at line 3618 of file z3++.h.

3618{ return probe(p2.ctx(), p1) == p2; }

◆ operator==() [3/8]

expr operator== ( expr const a,
double  b 
)
inline

Definition at line 1925 of file z3++.h.

1925{ assert(a.is_fpa()); return a == a.ctx().fpa_val(b); }

◆ operator==() [4/8]

expr operator== ( expr const a,
expr const b 
)
inline

Definition at line 1917 of file z3++.h.

1917 {
1918 check_context(a, b);
1919 Z3_ast r = Z3_mk_eq(a.ctx(), a, b);
1920 a.check_error();
1921 return expr(a.ctx(), r);
1922 }
Z3_ast Z3_API Z3_mk_eq(Z3_context c, Z3_ast l, Z3_ast r)
Create an AST node representing l = r.

◆ operator==() [5/8]

expr operator== ( expr const a,
int  b 
)
inline

Definition at line 1923 of file z3++.h.

1923{ assert(a.is_arith() || a.is_bv() || a.is_fpa()); return a == a.ctx().num_val(b, a.get_sort()); }

◆ operator==() [6/8]

expr operator== ( int  a,
expr const b 
)
inline

Definition at line 1924 of file z3++.h.

1924{ assert(b.is_arith() || b.is_bv() || b.is_fpa()); return b.ctx().num_val(a, b.get_sort()) == b; }

◆ operator==() [7/8]

probe operator== ( probe const p1,
double  p2 
)
inline

Definition at line 3617 of file z3++.h.

3617{ return p1 == probe(p1.ctx(), p2); }

◆ operator==() [8/8]

probe operator== ( probe const p1,
probe const p2 
)
inline

Definition at line 3614 of file z3++.h.

3614 {
3615 check_context(p1, p2); Z3_probe r = Z3_probe_eq(p1.ctx(), p1, p2); p1.check_error(); return probe(p1.ctx(), r);
3616 }
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 ...

◆ operator>() [1/6]

probe operator> ( double  p1,
probe const p2 
)
inline

Definition at line 3613 of file z3++.h.

3613{ return probe(p2.ctx(), p1) > p2; }

◆ operator>() [2/6]

expr operator> ( expr const a,
expr const b 
)
inline

Definition at line 2125 of file z3++.h.

2125 {
2126 check_context(a, b);
2127 Z3_ast r = 0;
2128 if (a.is_arith() && b.is_arith()) {
2129 r = Z3_mk_gt(a.ctx(), a, b);
2130 }
2131 else if (a.is_bv() && b.is_bv()) {
2132 r = Z3_mk_bvsgt(a.ctx(), a, b);
2133 }
2134 else if (a.is_fpa() && b.is_fpa()) {
2135 r = Z3_mk_fpa_gt(a.ctx(), a, b);
2136 }
2137 else {
2138 // operator is not supported by given arguments.
2139 assert(false);
2140 }
2141 a.check_error();
2142 return expr(a.ctx(), r);
2143 }
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_fpa_gt(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point greater than.
Z3_ast Z3_API Z3_mk_gt(Z3_context c, Z3_ast t1, Z3_ast t2)
Create greater than.

◆ operator>() [3/6]

expr operator> ( expr const a,
int  b 
)
inline

Definition at line 2144 of file z3++.h.

2144{ return a > a.ctx().num_val(b, a.get_sort()); }

◆ operator>() [4/6]

expr operator> ( int  a,
expr const b 
)
inline

Definition at line 2145 of file z3++.h.

2145{ return b.ctx().num_val(a, b.get_sort()) > b; }

◆ operator>() [5/6]

probe operator> ( probe const p1,
double  p2 
)
inline

Definition at line 3612 of file z3++.h.

3612{ return p1 > probe(p1.ctx(), p2); }

◆ operator>() [6/6]

probe operator> ( probe const p1,
probe const p2 
)
inline

Definition at line 3609 of file z3++.h.

3609 {
3610 check_context(p1, p2); Z3_probe r = Z3_probe_gt(p1.ctx(), p1, p2); p1.check_error(); return probe(p1.ctx(), r);
3611 }
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...

◆ operator>=() [1/6]

probe operator>= ( double  p1,
probe const p2 
)
inline

Definition at line 3603 of file z3++.h.

3603{ return probe(p2.ctx(), p1) >= p2; }

◆ operator>=() [2/6]

expr operator>= ( expr const a,
expr const b 
)
inline

Definition at line 1994 of file z3++.h.

1994 {
1995 check_context(a, b);
1996 Z3_ast r = 0;
1997 if (a.is_arith() && b.is_arith()) {
1998 r = Z3_mk_ge(a.ctx(), a, b);
1999 }
2000 else if (a.is_bv() && b.is_bv()) {
2001 r = Z3_mk_bvsge(a.ctx(), a, b);
2002 }
2003 else if (a.is_fpa() && b.is_fpa()) {
2004 r = Z3_mk_fpa_geq(a.ctx(), a, b);
2005 }
2006 else {
2007 // operator is not supported by given arguments.
2008 assert(false);
2009 }
2010 a.check_error();
2011 return expr(a.ctx(), r);
2012 }
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.
Z3_ast Z3_API Z3_mk_fpa_geq(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point greater than or equal.

◆ operator>=() [3/6]

expr operator>= ( expr const a,
int  b 
)
inline

Definition at line 2100 of file z3++.h.

2100{ return a >= a.ctx().num_val(b, a.get_sort()); }

◆ operator>=() [4/6]

expr operator>= ( int  a,
expr const b 
)
inline

Definition at line 2101 of file z3++.h.

2101{ return b.ctx().num_val(a, b.get_sort()) >= b; }

◆ operator>=() [5/6]

probe operator>= ( probe const p1,
double  p2 
)
inline

Definition at line 3602 of file z3++.h.

3602{ return p1 >= probe(p1.ctx(), p2); }

◆ operator>=() [6/6]

probe operator>= ( probe const p1,
probe const p2 
)
inline

Definition at line 3599 of file z3++.h.

3599 {
3600 check_context(p1, p2); Z3_probe r = Z3_probe_ge(p1.ctx(), p1, p2); p1.check_error(); return probe(p1.ctx(), r);
3601 }
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...

◆ operator^() [1/3]

expr operator^ ( expr const a,
expr const b 
)
inline

Definition at line 2151 of file z3++.h.

2151{ check_context(a, b); Z3_ast r = a.is_bool() ? Z3_mk_xor(a.ctx(), a, b) : Z3_mk_bvxor(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r); }
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_xor(Z3_context c, Z3_ast t1, Z3_ast t2)
Create an AST node representing t1 xor t2.

◆ operator^() [2/3]

expr operator^ ( expr const a,
int  b 
)
inline

Definition at line 2152 of file z3++.h.

2152{ return a ^ a.ctx().num_val(b, a.get_sort()); }

◆ operator^() [3/3]

expr operator^ ( int  a,
expr const b 
)
inline

Definition at line 2153 of file z3++.h.

2153{ return b.ctx().num_val(a, b.get_sort()) ^ b; }

◆ operator|() [1/4]

expr operator| ( expr const a,
expr const b 
)
inline

Definition at line 2155 of file z3++.h.

2155{ if (a.is_bool()) return a || b; check_context(a, b); Z3_ast r = Z3_mk_bvor(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r); }
Z3_ast Z3_API Z3_mk_bvor(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise or.

◆ operator|() [2/4]

expr operator| ( expr const a,
int  b 
)
inline

Definition at line 2156 of file z3++.h.

2156{ return a | a.ctx().num_val(b, a.get_sort()); }

◆ operator|() [3/4]

expr operator| ( int  a,
expr const b 
)
inline

Definition at line 2157 of file z3++.h.

2157{ return b.ctx().num_val(a, b.get_sort()) | b; }

◆ operator|() [4/4]

tactic operator| ( tactic const t1,
tactic const t2 
)
inline

Definition at line 3472 of file z3++.h.

3472 {
3474 Z3_tactic r = Z3_tactic_or_else(t1.ctx(), t1, t2);
3475 t1.check_error();
3476 return tactic(t1.ctx(), r);
3477 }
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...

◆ operator||() [1/4]

expr operator|| ( bool  a,
expr const b 
)
inline
Precondition
b.is_bool()

Definition at line 1915 of file z3++.h.

1915{ return b.ctx().bool_val(a) || b; }

◆ operator||() [2/4]

expr operator|| ( expr const a,
bool  b 
)
inline
Precondition
a.is_bool()

Definition at line 1913 of file z3++.h.

1913{ return a || a.ctx().bool_val(b); }

◆ operator||() [3/4]

expr operator|| ( expr const a,
expr const b 
)
inline
Precondition
a.is_bool()
b.is_bool()

Definition at line 1904 of file z3++.h.

1904 {
1905 check_context(a, b);
1906 assert(a.is_bool() && b.is_bool());
1907 Z3_ast args[2] = { a, b };
1908 Z3_ast r = Z3_mk_or(a.ctx(), 2, args);
1909 a.check_error();
1910 return expr(a.ctx(), r);
1911 }

◆ operator||() [4/4]

probe operator|| ( probe const p1,
probe const p2 
)
inline

Definition at line 3622 of file z3++.h.

3622 {
3623 check_context(p1, p2); Z3_probe r = Z3_probe_or(p1.ctx(), p1, p2); p1.check_error(); return probe(p1.ctx(), r);
3624 }
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.

◆ operator~()

expr operator~ ( expr const a)
inline

Definition at line 2240 of file z3++.h.

2240{ Z3_ast r = Z3_mk_bvnot(a.ctx(), a); return expr(a.ctx(), r); }
Z3_ast Z3_API Z3_mk_bvnot(Z3_context c, Z3_ast t1)
Bitwise negation.

◆ option()

expr option ( expr const re)
inline

Definition at line 4541 of file z3++.h.

4541 {
4543 }
Z3_ast Z3_API Z3_mk_re_option(Z3_context c, Z3_ast re)
Create the regular language [re].

◆ par_and_then()

tactic par_and_then ( tactic const t1,
tactic const t2 
)
inline

Definition at line 3504 of file z3++.h.

3504 {
3506 Z3_tactic r = Z3_tactic_par_and_then(t1.ctx(), t1, t2);
3507 t1.check_error();
3508 return tactic(t1.ctx(), r);
3509 }
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....

◆ par_or()

tactic par_or ( unsigned  n,
tactic const tactics 
)
inline

Definition at line 3495 of file z3++.h.

3495 {
3496 if (n == 0) {
3497 Z3_THROW(exception("a non-zero number of tactics need to be passed to par_or"));
3498 }
3499 array<Z3_tactic> buffer(n);
3500 for (unsigned i = 0; i < n; ++i) buffer[i] = tactics[i];
3501 return tactic(tactics[0u].ctx(), Z3_tactic_par_or(tactics[0u].ctx(), n, buffer.ptr()));
3502 }
Exception used to sign API usage errors.
Definition z3++.h:119
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.
#define Z3_THROW(x)
Definition z3++.h:134

◆ partial_order()

func_decl partial_order ( sort const a,
unsigned  index 
)
inline

Definition at line 2492 of file z3++.h.

2492 {
2493 return to_func_decl(a.ctx(), Z3_mk_partial_order(a.ctx(), a, index));
2494 }
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.

◆ pbeq()

expr pbeq ( expr_vector const es,
int const coeffs,
int  bound 
)
inline

Definition at line 2646 of file z3++.h.

2646 {
2647 assert(es.size() > 0);
2648 context& ctx = es[0u].ctx();
2650 Z3_ast r = Z3_mk_pbeq(ctx, _es.size(), _es.ptr(), coeffs, bound);
2651 ctx.check_error();
2652 return expr(ctx, r);
2653 }
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.

◆ pbge()

expr pbge ( expr_vector const es,
int const coeffs,
int  bound 
)
inline

Definition at line 2638 of file z3++.h.

2638 {
2639 assert(es.size() > 0);
2640 context& ctx = es[0u].ctx();
2642 Z3_ast r = Z3_mk_pbge(ctx, _es.size(), _es.ptr(), coeffs, bound);
2643 ctx.check_error();
2644 return expr(ctx, r);
2645 }
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.

◆ pble()

expr pble ( expr_vector const es,
int const coeffs,
int  bound 
)
inline

Definition at line 2630 of file z3++.h.

2630 {
2631 assert(es.size() > 0);
2632 context& ctx = es[0u].ctx();
2634 Z3_ast r = Z3_mk_pble(ctx, _es.size(), _es.ptr(), coeffs, bound);
2635 ctx.check_error();
2636 return expr(ctx, r);
2637 }
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.

◆ piecewise_linear_order()

func_decl piecewise_linear_order ( sort const a,
unsigned  index 
)
inline

Definition at line 2495 of file z3++.h.

2495 {
2496 return to_func_decl(a.ctx(), Z3_mk_piecewise_linear_order(a.ctx(), a, index));
2497 }
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.

◆ plus()

expr plus ( expr const re)
inline

Definition at line 4538 of file z3++.h.

4538 {
4540 }
Z3_ast Z3_API Z3_mk_re_plus(Z3_context c, Z3_ast re)
Create the regular language re+.

◆ polynomial_subresultants()

expr_vector polynomial_subresultants ( expr const p,
expr const q,
expr const x 
)
inline

Return the nonzero subresultants of p and q with respect to the "variable" x.

Precondition
p, q and x are Z3 expressions where p and q are arithmetic terms. Note that, any subterm that cannot be viewed as a polynomial is assumed to be a variable.

Definition at line 2508 of file z3++.h.

2508 {
2509 check_context(p, q); check_context(p, x);
2510 Z3_ast_vector r = Z3_polynomial_subresultants(p.ctx(), p, q, x);
2511 p.check_error();
2512 return expr_vector(p.ctx(), r);
2513 }
Z3_ast_vector Z3_API Z3_polynomial_subresultants(Z3_context c, Z3_ast p, Z3_ast q, Z3_ast x)
Return the nonzero subresultants of p and q with respect to the "variable" x.

◆ prefixof()

expr prefixof ( expr const a,
expr const b 
)
inline

Definition at line 4514 of file z3++.h.

4514 {
4515 check_context(a, b);
4516 Z3_ast r = Z3_mk_seq_prefix(a.ctx(), a, b);
4517 a.check_error();
4518 return expr(a.ctx(), r);
4519 }
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.

◆ pw() [1/3]

expr pw ( expr const a,
expr const b 
)
inline

Definition at line 1848 of file z3++.h.

1848{ _Z3_MK_BIN_(a, b, Z3_mk_power); }
Z3_ast Z3_API Z3_mk_power(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Create an AST node representing arg1 ^ arg2.

◆ pw() [2/3]

expr pw ( expr const a,
int  b 
)
inline

Definition at line 1849 of file z3++.h.

1849{ return pw(a, a.ctx().num_val(b, a.get_sort())); }
expr pw(expr const &a, expr const &b)
Definition z3++.h:1848

◆ pw() [3/3]

expr pw ( int  a,
expr const b 
)
inline

Definition at line 1850 of file z3++.h.

1850{ return pw(b.ctx().num_val(a, b.get_sort()), b); }

◆ qe_lite()

expr qe_lite ( expr_vector const vars,
expr const body 
)
inline

Definition at line 2940 of file z3++.h.

2940 {
2941 check_context(vars, body);
2942 Z3_ast r = Z3_qe_lite(body.ctx(), vars, body);
2943 body.check_error();
2944 return expr(body.ctx(), r);
2945 }

◆ qe_model_project()

expr qe_model_project ( model const m,
expr_vector const bounds,
expr const body 
)
inline

Definition at line 2957 of file z3++.h.

2957 {
2959 std::vector<Z3_app> apps = to_apps(bounds);
2960 Z3_ast r = Z3_qe_model_project(m.ctx(), m, bounds.size(), apps.data(), body);
2961 m.check_error();
2962 return expr(m.ctx(), r);
2963 }
std::vector< Z3_app > to_apps(expr_vector const &bounds)
Definition z3++.h:2947

◆ qe_model_project_skolem()

expr qe_model_project_skolem ( model const m,
expr_vector const bounds,
expr const body,
ast_map map 
)
inline

Project variables and write the introduced Skolem terms to map.

Definition at line 2968 of file z3++.h.

2968 {
2970 std::vector<Z3_app> apps = to_apps(bounds);
2971 Z3_ast r = Z3_qe_model_project_skolem(m.ctx(), m, bounds.size(), apps.data(), body, map);
2972 m.check_error();
2973 return expr(m.ctx(), r);
2974 }

◆ qe_model_project_with_witness()

expr qe_model_project_with_witness ( model const m,
expr_vector const bounds,
expr const body,
ast_map map 
)
inline

Project variables and write the introduced witnesses to map.

Definition at line 2979 of file z3++.h.

2979 {
2981 std::vector<Z3_app> apps = to_apps(bounds);
2982 Z3_ast r = Z3_qe_model_project_with_witness(m.ctx(), m, bounds.size(), apps.data(), body, map);
2983 m.check_error();
2984 return expr(m.ctx(), r);
2985 }

◆ range()

expr range ( expr const lo,
expr const hi 
)
inline

Definition at line 4575 of file z3++.h.

4575 {
4576 check_context(lo, hi);
4577 Z3_ast r = Z3_mk_re_range(lo.ctx(), lo, hi);
4578 lo.check_error();
4579 return expr(lo.ctx(), r);
4580 }
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.

Referenced by context::function(), function(), context::function(), function(), context::function(), function(), context::function(), function(), context::function(), function(), context::function(), function(), context::function(), function(), function(), context::function(), context::function(), function(), context::recfun(), recfun(), recfun(), context::recfun(), context::recfun(), context::recfun(), recfun(), context::recfun(), context::recfun(), recfun(), and context::user_propagate_function().

◆ rcf_e()

rcf_num rcf_e ( context c)
inline

Create an RCF numeral representing e (Euler's constant).

Definition at line 5228 of file z3++.h.

5228 {
5229 return rcf_num(c, Z3_rcf_mk_e(c));
5230 }
Wrapper for Z3 Real Closed Field (RCF) numerals.
Definition z3++.h:5061
Z3_rcf_num Z3_API Z3_rcf_mk_e(Z3_context c)
Return e (Euler's constant)

◆ rcf_infinitesimal()

rcf_num rcf_infinitesimal ( context c)
inline

Create an RCF numeral representing an infinitesimal.

Definition at line 5235 of file z3++.h.

5235 {
5236 return rcf_num(c, Z3_rcf_mk_infinitesimal(c));
5237 }
Z3_rcf_num Z3_API Z3_rcf_mk_infinitesimal(Z3_context c)
Return a new infinitesimal that is smaller than all elements in the Z3 field.

◆ rcf_pi()

rcf_num rcf_pi ( context c)
inline

Create an RCF numeral representing pi.

Definition at line 5221 of file z3++.h.

5221 {
5222 return rcf_num(c, Z3_rcf_mk_pi(c));
5223 }
Z3_rcf_num Z3_API Z3_rcf_mk_pi(Z3_context c)
Return Pi.

◆ rcf_roots()

std::vector< rcf_num > rcf_roots ( context c,
std::vector< rcf_num > const coeffs 
)
inline

Find roots of a polynomial with given coefficients.

The polynomial is a[n-1]*x^(n-1) + ... + a[1]*x + a[0]. Returns a vector of RCF numerals representing the roots.

Definition at line 5245 of file z3++.h.

5245 {
5246 if (coeffs.empty()) {
5247 Z3_THROW(exception("polynomial coefficients cannot be empty"));
5248 }
5249
5250 unsigned n = static_cast<unsigned>(coeffs.size());
5251 std::vector<Z3_rcf_num> a(n);
5252 std::vector<Z3_rcf_num> roots(n);
5253
5254 for (unsigned i = 0; i < n; ++i) {
5255 a[i] = coeffs[i];
5256 }
5257
5258 unsigned num_roots = Z3_rcf_mk_roots(c, n, a.data(), roots.data());
5259
5260 std::vector<rcf_num> result;
5261 result.reserve(num_roots);
5262 for (unsigned i = 0; i < num_roots; ++i) {
5263 result.push_back(rcf_num(c, roots[i]));
5264 }
5265
5266 return result;
5267 }
unsigned Z3_API Z3_rcf_mk_roots(Z3_context c, unsigned n, Z3_rcf_num const a[], Z3_rcf_num roots[])
Store in roots the roots of the polynomial a[n-1]*x^{n-1} + ... + a[0]. The output vector roots must ...

◆ re_complement()

expr re_complement ( expr const a)
inline

Definition at line 4572 of file z3++.h.

4572 {
4574 }
Z3_ast Z3_API Z3_mk_re_complement(Z3_context c, Z3_ast re)
Create the complement of the regular language re.

◆ re_diff()

expr re_diff ( expr const a,
expr const b 
)
inline

Definition at line 4565 of file z3++.h.

4565 {
4566 check_context(a, b);
4567 context& ctx = a.ctx();
4568 Z3_ast r = Z3_mk_re_diff(ctx, a, b);
4569 ctx.check_error();
4570 return expr(ctx, r);
4571 }
Z3_ast Z3_API Z3_mk_re_diff(Z3_context c, Z3_ast re1, Z3_ast re2)
Create the difference of regular expressions.

◆ re_empty()

expr re_empty ( sort const s)
inline

Definition at line 4547 of file z3++.h.

4547 {
4548 Z3_ast r = Z3_mk_re_empty(s.ctx(), s);
4549 s.check_error();
4550 return expr(s.ctx(), r);
4551 }
Z3_ast Z3_API Z3_mk_re_empty(Z3_context c, Z3_sort re)
Create an empty regular expression of sort re.

◆ re_full()

expr re_full ( sort const s)
inline

Definition at line 4552 of file z3++.h.

4552 {
4553 Z3_ast r = Z3_mk_re_full(s.ctx(), s);
4554 s.check_error();
4555 return expr(s.ctx(), r);
4556 }
Z3_ast Z3_API Z3_mk_re_full(Z3_context c, Z3_sort re)
Create an universal regular expression of sort re.

◆ re_intersect()

expr re_intersect ( expr_vector const args)
inline

Definition at line 4557 of file z3++.h.

4557 {
4558 assert(args.size() > 0);
4559 context& ctx = args[0u].ctx();
4560 array<Z3_ast> _args(args);
4561 Z3_ast r = Z3_mk_re_intersect(ctx, _args.size(), _args.ptr());
4562 ctx.check_error();
4563 return expr(ctx, r);
4564 }
Z3_ast Z3_API Z3_mk_re_intersect(Z3_context c, unsigned n, Z3_ast const args[])
Create the intersection of the regular languages.

◆ recfun() [1/4]

func_decl recfun ( char const name,
sort const d1,
sort const d2,
sort const range 
)
inline

Definition at line 4328 of file z3++.h.

4328 {
4329 return range.ctx().recfun(name, d1, d2, range);
4330 }
func_decl recfun(symbol const &name, unsigned arity, sort const *domain, sort const &range)
Definition z3++.h:4082

◆ recfun() [2/4]

func_decl recfun ( char const name,
sort const d1,
sort const range 
)
inline

Definition at line 4325 of file z3++.h.

4325 {
4326 return range.ctx().recfun(name, d1, range);
4327 }

◆ recfun() [3/4]

func_decl recfun ( char const name,
unsigned  arity,
sort const domain,
sort const range 
)
inline

Definition at line 4322 of file z3++.h.

4322 {
4323 return range.ctx().recfun(name, arity, domain, range);
4324 }

◆ recfun() [4/4]

func_decl recfun ( symbol const name,
unsigned  arity,
sort const domain,
sort const range 
)
inline

Definition at line 4319 of file z3++.h.

4319 {
4320 return range.ctx().recfun(name, arity, domain, range);
4321 }

◆ rem() [1/3]

expr rem ( expr const a,
expr const b 
)
inline

Definition at line 1868 of file z3++.h.

1868 {
1869 if (a.is_fpa() && b.is_fpa()) {
1871 } else {
1872 _Z3_MK_BIN_(a, b, Z3_mk_rem);
1873 }
1874 }
Z3_ast Z3_API Z3_mk_fpa_rem(Z3_context c, Z3_ast t1, Z3_ast t2)
Floating-point remainder.
Z3_ast Z3_API Z3_mk_rem(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Create an AST node representing arg1 rem arg2.

◆ rem() [2/3]

expr rem ( expr const a,
int  b 
)
inline

Definition at line 1875 of file z3++.h.

1875{ return rem(a, a.ctx().num_val(b, a.get_sort())); }
expr rem(expr const &a, expr const &b)
Definition z3++.h:1868

◆ rem() [3/3]

expr rem ( int  a,
expr const b 
)
inline

Definition at line 1876 of file z3++.h.

1876{ return rem(b.ctx().num_val(a, b.get_sort()), b); }

◆ repeat()

tactic repeat ( tactic const t,
unsigned  max = UINT_MAX 
)
inline

Definition at line 3479 of file z3++.h.

3479 {
3480 Z3_tactic r = Z3_tactic_repeat(t.ctx(), t, max);
3481 t.check_error();
3482 return tactic(t.ctx(), r);
3483 }
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...

◆ reset_params()

void reset_params ( )
inline

Definition at line 84 of file z3++.h.

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...

◆ round_fpa_to_closest_integer()

expr round_fpa_to_closest_integer ( expr const t)
inline

Definition at line 2293 of file z3++.h.

2293 {
2294 assert(t.is_fpa());
2295 Z3_ast r = Z3_mk_fpa_round_to_integral(t.ctx(), t.ctx().fpa_rounding_mode(), t);
2296 t.check_error();
2297 return expr(t.ctx(), r);
2298 }
Z3_ast Z3_API Z3_mk_fpa_round_to_integral(Z3_context c, Z3_ast rm, Z3_ast t)
Floating-point roundToIntegral. Rounds a floating-point number to the closest integer,...

◆ sbv_to_fpa()

expr sbv_to_fpa ( expr const t,
sort  s 
)
inline

Definition at line 2272 of file z3++.h.

2272 {
2273 assert(t.is_bv());
2274 Z3_ast r = Z3_mk_fpa_to_fp_signed(t.ctx(), t.ctx().fpa_rounding_mode(), t, s);
2275 t.check_error();
2276 return expr(t.ctx(), r);
2277 }
Z3_ast Z3_API Z3_mk_fpa_to_fp_signed(Z3_context c, Z3_ast rm, Z3_ast t, Z3_sort s)
Conversion of a 2's complement signed bit-vector term into a term of FloatingPoint sort.

◆ sdiv() [1/3]

expr sdiv ( expr const a,
expr const b 
)
inline

signed division operator for bitvectors.

Definition at line 2391 of file z3++.h.

2391{ return to_expr(a.ctx(), Z3_mk_bvsdiv(a.ctx(), a, b)); }

Referenced by sdiv(), and sdiv().

◆ sdiv() [2/3]

expr sdiv ( expr const a,
int  b 
)
inline

Definition at line 2392 of file z3++.h.

2392{ return sdiv(a, a.ctx().num_val(b, a.get_sort())); }
expr sdiv(expr const &a, expr const &b)
signed division operator for bitvectors.
Definition z3++.h:2391

◆ sdiv() [3/3]

expr sdiv ( int  a,
expr const b 
)
inline

Definition at line 2393 of file z3++.h.

2393{ return sdiv(b.ctx().num_val(a, b.get_sort()), b); }

◆ select() [1/3]

expr select ( expr const a,
expr const i 
)
inline

forward declarations

Definition at line 4332 of file z3++.h.

4332 {
4333 check_context(a, i);
4334 Z3_ast r = Z3_mk_select(a.ctx(), a, i);
4335 a.check_error();
4336 return expr(a.ctx(), r);
4337 }
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.

Referenced by expr::operator[](), expr::operator[](), and select().

◆ select() [2/3]

expr select ( expr const a,
expr_vector const i 
)
inline

Definition at line 4341 of file z3++.h.

4341 {
4342 check_context(a, i);
4344 Z3_ast r = Z3_mk_select_n(a.ctx(), a, idxs.size(), idxs.ptr());
4345 a.check_error();
4346 return expr(a.ctx(), r);
4347 }
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.

◆ select() [3/3]

expr select ( expr const a,
int  i 
)
inline

Definition at line 4338 of file z3++.h.

4338 {
4339 return select(a, a.ctx().num_val(i, a.get_sort().array_domain()));
4340 }
expr select(expr const &a, expr const &i)
forward declarations
Definition z3++.h:4332

◆ set_add()

expr set_add ( expr const s,
expr const e 
)
inline

Definition at line 4411 of file z3++.h.

4411 {
4412 MK_EXPR2(Z3_mk_set_add, s, e);
4413 }
Z3_ast Z3_API Z3_mk_set_add(Z3_context c, Z3_ast set, Z3_ast elem)
Add an element to a set.

◆ set_complement()

expr set_complement ( expr const a)
inline

Definition at line 4439 of file z3++.h.

4439 {
4441 }
Z3_ast Z3_API Z3_mk_set_complement(Z3_context c, Z3_ast arg)
Take the complement of a set.

◆ set_del()

expr set_del ( expr const s,
expr const e 
)
inline

Definition at line 4415 of file z3++.h.

4415 {
4416 MK_EXPR2(Z3_mk_set_del, s, e);
4417 }
Z3_ast Z3_API Z3_mk_set_del(Z3_context c, Z3_ast set, Z3_ast elem)
Remove an element to a set.

◆ set_difference()

expr set_difference ( expr const a,
expr const b 
)
inline

Definition at line 4435 of file z3++.h.

4435 {
4437 }
Z3_ast Z3_API Z3_mk_set_difference(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Take the set difference between two sets.

◆ set_intersect()

expr set_intersect ( expr const a,
expr const b 
)
inline

Definition at line 4427 of file z3++.h.

4427 {
4428 check_context(a, b);
4429 Z3_ast es[2] = { a, b };
4430 Z3_ast r = Z3_mk_set_intersect(a.ctx(), 2, es);
4431 a.check_error();
4432 return expr(a.ctx(), r);
4433 }
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.

◆ set_member()

expr set_member ( expr const s,
expr const e 
)
inline

Definition at line 4443 of file z3++.h.

4443 {
4445 }
Z3_ast Z3_API Z3_mk_set_member(Z3_context c, Z3_ast elem, Z3_ast set)
Check for set membership.

◆ set_param() [1/3]

void set_param ( char const param,
bool  value 
)
inline

Definition at line 82 of file z3++.h.

82{ Z3_global_param_set(param, value ? "true" : "false"); }
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.

◆ set_param() [2/3]

void set_param ( char const param,
char const value 
)
inline

Definition at line 81 of file z3++.h.

81{ Z3_global_param_set(param, value); }

◆ set_param() [3/3]

void set_param ( char const param,
int  value 
)
inline

Definition at line 83 of file z3++.h.

83{ auto str = std::to_string(value); Z3_global_param_set(param, str.c_str()); }

◆ set_subset()

expr set_subset ( expr const a,
expr const b 
)
inline

Definition at line 4447 of file z3++.h.

4447 {
4449 }
Z3_ast Z3_API Z3_mk_set_subset(Z3_context c, Z3_ast arg1, Z3_ast arg2)
Check for subsetness of sets.

◆ set_union()

expr set_union ( expr const a,
expr const b 
)
inline

Definition at line 4419 of file z3++.h.

4419 {
4420 check_context(a, b);
4421 Z3_ast es[2] = { a, b };
4422 Z3_ast r = Z3_mk_set_union(a.ctx(), 2, es);
4423 a.check_error();
4424 return expr(a.ctx(), r);
4425 }
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.

◆ sext()

expr 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 2487 of file z3++.h.

2487{ return to_expr(a.ctx(), Z3_mk_sign_ext(a.ctx(), i, a)); }
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,...

◆ sge() [1/3]

expr sge ( expr const a,
expr const b 
)
inline

signed greater than or equal to operator for bitvectors.

Definition at line 2352 of file z3++.h.

2352{ return to_expr(a.ctx(), Z3_mk_bvsge(a.ctx(), a, b)); }

Referenced by sge(), and sge().

◆ sge() [2/3]

expr sge ( expr const a,
int  b 
)
inline

Definition at line 2353 of file z3++.h.

2353{ return sge(a, a.ctx().num_val(b, a.get_sort())); }
expr sge(expr const &a, expr const &b)
signed greater than or equal to operator for bitvectors.
Definition z3++.h:2352

◆ sge() [3/3]

expr sge ( int  a,
expr const b 
)
inline

Definition at line 2354 of file z3++.h.

2354{ return sge(b.ctx().num_val(a, b.get_sort()), b); }

◆ sgt() [1/3]

expr sgt ( expr const a,
expr const b 
)
inline

signed greater than operator for bitvectors.

Definition at line 2358 of file z3++.h.

2358{ return to_expr(a.ctx(), Z3_mk_bvsgt(a.ctx(), a, b)); }

Referenced by sgt(), and sgt().

◆ sgt() [2/3]

expr sgt ( expr const a,
int  b 
)
inline

Definition at line 2359 of file z3++.h.

2359{ return sgt(a, a.ctx().num_val(b, a.get_sort())); }
expr sgt(expr const &a, expr const &b)
signed greater than operator for bitvectors.
Definition z3++.h:2358

◆ sgt() [3/3]

expr sgt ( int  a,
expr const b 
)
inline

Definition at line 2360 of file z3++.h.

2360{ return sgt(b.ctx().num_val(a, b.get_sort()), b); }

◆ shl() [1/3]

expr shl ( expr const a,
expr const b 
)
inline

shift left operator for bitvectors

Definition at line 2426 of file z3++.h.

2426{ return to_expr(a.ctx(), Z3_mk_bvshl(a.ctx(), a, b)); }
Z3_ast Z3_API Z3_mk_bvshl(Z3_context c, Z3_ast t1, Z3_ast t2)
Shift left.

Referenced by shl(), and shl().

◆ shl() [2/3]

expr shl ( expr const a,
int  b 
)
inline

Definition at line 2427 of file z3++.h.

2427{ return shl(a, a.ctx().num_val(b, a.get_sort())); }
expr shl(expr const &a, expr const &b)
shift left operator for bitvectors
Definition z3++.h:2426

◆ shl() [3/3]

expr shl ( int  a,
expr const b 
)
inline

Definition at line 2428 of file z3++.h.

2428{ return shl(b.ctx().num_val(a, b.get_sort()), b); }

◆ sle() [1/3]

expr sle ( expr const a,
expr const b 
)
inline

signed less than or equal to operator for bitvectors.

Definition at line 2340 of file z3++.h.

2340{ return to_expr(a.ctx(), Z3_mk_bvsle(a.ctx(), a, b)); }

Referenced by sle(), and sle().

◆ sle() [2/3]

expr sle ( expr const a,
int  b 
)
inline

Definition at line 2341 of file z3++.h.

2341{ return sle(a, a.ctx().num_val(b, a.get_sort())); }
expr sle(expr const &a, expr const &b)
signed less than or equal to operator for bitvectors.
Definition z3++.h:2340

◆ sle() [3/3]

expr sle ( int  a,
expr const b 
)
inline

Definition at line 2342 of file z3++.h.

2342{ return sle(b.ctx().num_val(a, b.get_sort()), b); }

◆ slt() [1/3]

expr slt ( expr const a,
expr const b 
)
inline

signed less than operator for bitvectors.

Definition at line 2346 of file z3++.h.

2346{ return to_expr(a.ctx(), Z3_mk_bvslt(a.ctx(), a, b)); }

Referenced by slt(), and slt().

◆ slt() [2/3]

expr slt ( expr const a,
int  b 
)
inline

Definition at line 2347 of file z3++.h.

2347{ return slt(a, a.ctx().num_val(b, a.get_sort())); }
expr slt(expr const &a, expr const &b)
signed less than operator for bitvectors.
Definition z3++.h:2346

◆ slt() [3/3]

expr slt ( int  a,
expr const b 
)
inline

Definition at line 2348 of file z3++.h.

2348{ return slt(b.ctx().num_val(a, b.get_sort()), b); }

◆ smod() [1/3]

expr smod ( expr const a,
expr const b 
)
inline

signed modulus operator for bitvectors

Definition at line 2412 of file z3++.h.

2412{ return to_expr(a.ctx(), Z3_mk_bvsmod(a.ctx(), a, b)); }

Referenced by smod(), and smod().

◆ smod() [2/3]

expr smod ( expr const a,
int  b 
)
inline

Definition at line 2413 of file z3++.h.

2413{ return smod(a, a.ctx().num_val(b, a.get_sort())); }
expr smod(expr const &a, expr const &b)
signed modulus operator for bitvectors
Definition z3++.h:2412

◆ smod() [3/3]

expr smod ( int  a,
expr const b 
)
inline

Definition at line 2414 of file z3++.h.

2414{ return smod(b.ctx().num_val(a, b.get_sort()), b); }

◆ sqrt()

expr sqrt ( expr const a,
expr const rm 
)
inline

Definition at line 2226 of file z3++.h.

2226 {
2227 check_context(a, rm);
2228 assert(a.is_fpa());
2229 Z3_ast r = Z3_mk_fpa_sqrt(a.ctx(), rm, a);
2230 a.check_error();
2231 return expr(a.ctx(), r);
2232 }
Z3_ast Z3_API Z3_mk_fpa_sqrt(Z3_context c, Z3_ast rm, Z3_ast t)
Floating-point square root.

◆ srem() [1/3]

expr srem ( expr const a,
expr const b 
)
inline

signed remainder operator for bitvectors

Definition at line 2405 of file z3++.h.

2405{ return to_expr(a.ctx(), Z3_mk_bvsrem(a.ctx(), a, b)); }
Z3_ast Z3_API Z3_mk_bvsrem(Z3_context c, Z3_ast t1, Z3_ast t2)
Two's complement signed remainder (sign follows dividend).

Referenced by srem(), and srem().

◆ srem() [2/3]

expr srem ( expr const a,
int  b 
)
inline

Definition at line 2406 of file z3++.h.

2406{ return srem(a, a.ctx().num_val(b, a.get_sort())); }
expr srem(expr const &a, expr const &b)
signed remainder operator for bitvectors
Definition z3++.h:2405

◆ srem() [3/3]

expr srem ( int  a,
expr const b 
)
inline

Definition at line 2407 of file z3++.h.

2407{ return srem(b.ctx().num_val(a, b.get_sort()), b); }

◆ star()

expr star ( expr const re)
inline

Definition at line 4544 of file z3++.h.

4544 {
4546 }
Z3_ast Z3_API Z3_mk_re_star(Z3_context c, Z3_ast re)
Create the regular language re*.

◆ store() [1/5]

expr store ( expr const a,
expr const i,
expr const v 
)
inline

Definition at line 4349 of file z3++.h.

4349 {
4351 Z3_ast r = Z3_mk_store(a.ctx(), a, i, v);
4352 a.check_error();
4353 return expr(a.ctx(), r);
4354 }
Z3_ast Z3_API Z3_mk_store(Z3_context c, Z3_ast a, Z3_ast i, Z3_ast v)
Array update.

Referenced by store(), store(), and store().

◆ store() [2/5]

expr store ( expr const a,
expr  i,
int  v 
)
inline

Definition at line 4357 of file z3++.h.

4357{ return store(a, i, a.ctx().num_val(v, a.get_sort().array_range())); }
expr store(expr const &a, expr const &i, expr const &v)
Definition z3++.h:4349

◆ store() [3/5]

expr store ( expr const a,
expr_vector const i,
expr const v 
)
inline

Definition at line 4361 of file z3++.h.

4361 {
4364 Z3_ast r = Z3_mk_store_n(a.ctx(), a, idxs.size(), idxs.ptr(), v);
4365 a.check_error();
4366 return expr(a.ctx(), r);
4367 }
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.

◆ store() [4/5]

expr store ( expr const a,
int  i,
expr const v 
)
inline

Definition at line 4356 of file z3++.h.

4356{ return store(a, a.ctx().num_val(i, a.get_sort().array_domain()), v); }

◆ store() [5/5]

expr store ( expr const a,
int  i,
int  v 
)
inline

Definition at line 4358 of file z3++.h.

4358 {
4359 return store(a, a.ctx().num_val(i, a.get_sort().array_domain()), a.ctx().num_val(v, a.get_sort().array_range()));
4360 }

◆ suffixof()

expr suffixof ( expr const a,
expr const b 
)
inline

Definition at line 4508 of file z3++.h.

4508 {
4509 check_context(a, b);
4510 Z3_ast r = Z3_mk_seq_suffix(a.ctx(), a, b);
4511 a.check_error();
4512 return expr(a.ctx(), r);
4513 }
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.

◆ sum()

expr sum ( expr_vector const args)
inline

Definition at line 2670 of file z3++.h.

2670 {
2671 assert(args.size() > 0);
2672 context& ctx = args[0u].ctx();
2673 array<Z3_ast> _args(args);
2674 Z3_ast r = Z3_mk_add(ctx, _args.size(), _args.ptr());
2675 ctx.check_error();
2676 return expr(ctx, r);
2677 }

◆ to_apps()

std::vector< Z3_app > to_apps ( expr_vector const bounds)
inline

Definition at line 2947 of file z3++.h.

2947 {
2948 std::vector<Z3_app> apps;
2949 for (unsigned i = 0; i < bounds.size(); ++i) {
2950 if (!Z3_is_app(bounds.ctx(), bounds[i]))
2951 Z3_THROW(exception("model projection bounds must be applications"));
2952 apps.push_back(Z3_to_app(bounds.ctx(), bounds[i]));
2953 }
2954 return apps;
2955 }
Z3_app Z3_API Z3_to_app(Z3_context c, Z3_ast a)
Convert an ast into an APP_AST. This is just type casting.
bool Z3_API Z3_is_app(Z3_context c, Z3_ast a)

Referenced by qe_model_project(), qe_model_project_skolem(), and qe_model_project_with_witness().

◆ to_check_result()

check_result to_check_result ( Z3_lbool  l)
inline

Definition at line 178 of file z3++.h.

178 {
179 if (l == Z3_L_TRUE) return sat;
180 else if (l == Z3_L_FALSE) return unsat;
181 return unknown;
182 }
@ Z3_L_TRUE
Definition z3_api.h:61
@ Z3_L_FALSE
Definition z3_api.h:59

Referenced by solver::check(), optimize::check(), optimize::check(), solver::check(), solver::check(), solver::consequences(), fixedpoint::query(), and fixedpoint::query().

◆ to_expr()

expr to_expr ( context c,
Z3_ast  a 
)
inline

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 2318 of file z3++.h.

2318 {
2319 c.check_error();
2322 Z3_get_ast_kind(c, a) == Z3_VAR_AST ||
2324 return expr(c, a);
2325 }
Z3_ast_kind Z3_API Z3_get_ast_kind(Z3_context c, Z3_ast a)
Return the kind of the given AST.
@ Z3_APP_AST
Definition z3_api.h:144
@ Z3_VAR_AST
Definition z3_api.h:145
@ Z3_NUMERAL_AST
Definition z3_api.h:143
@ Z3_QUANTIFIER_AST
Definition z3_api.h:146

Referenced by ashr(), lshr(), sdiv(), sext(), sge(), sgt(), shl(), sle(), slt(), smod(), srem(), udiv(), uge(), ugt(), ule(), ult(), urem(), and zext().

◆ to_func_decl()

func_decl to_func_decl ( context c,
Z3_func_decl  f 
)
inline

Definition at line 2332 of file z3++.h.

2332 {
2333 c.check_error();
2334 return func_decl(c, f);
2335 }
Function declaration (aka function definition). It is the signature of interpreted and uninterpreted ...
Definition z3++.h:904

Referenced by linear_order(), partial_order(), piecewise_linear_order(), and tree_order().

◆ to_re()

expr to_re ( expr const s)
inline

Definition at line 4532 of file z3++.h.

4532 {
4534 }
Z3_ast Z3_API Z3_mk_seq_to_re(Z3_context c, Z3_ast seq)
Create a regular expression that accepts the sequence seq.

◆ to_real()

expr to_real ( expr const a)
inline

Definition at line 4289 of file z3++.h.

4289{ Z3_ast r = Z3_mk_int2real(a.ctx(), a); a.check_error(); return expr(a.ctx(), r); }
Z3_ast Z3_API Z3_mk_int2real(Z3_context c, Z3_ast t1)
Coerce an integer to a real.

◆ to_sort()

sort to_sort ( context c,
Z3_sort  s 
)
inline

Definition at line 2327 of file z3++.h.

2327 {
2328 c.check_error();
2329 return sort(c, s);
2330 }
A Z3 sort (aka type). Every expression (i.e., formula or term) in Z3 has a sort.
Definition z3++.h:801

Referenced by context::enumeration_sort(), context::tuple_sort(), context::uninterpreted_sort(), and context::uninterpreted_sort().

◆ tree_order()

func_decl tree_order ( sort const a,
unsigned  index 
)
inline

Definition at line 2498 of file z3++.h.

2498 {
2499 return to_func_decl(a.ctx(), Z3_mk_tree_order(a.ctx(), a, index));
2500 }
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.

◆ try_for()

tactic try_for ( tactic const t,
unsigned  ms 
)
inline

Definition at line 3490 of file z3++.h.

3490 {
3491 Z3_tactic r = Z3_tactic_try_for(t.ctx(), t, ms);
3492 t.check_error();
3493 return tactic(t.ctx(), r);
3494 }
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...

◆ ubv_to_fpa()

expr ubv_to_fpa ( expr const t,
sort  s 
)
inline

Definition at line 2279 of file z3++.h.

2279 {
2280 assert(t.is_bv());
2281 Z3_ast r = Z3_mk_fpa_to_fp_unsigned(t.ctx(), t.ctx().fpa_rounding_mode(), t, s);
2282 t.check_error();
2283 return expr(t.ctx(), r);
2284 }
Z3_ast Z3_API Z3_mk_fpa_to_fp_unsigned(Z3_context c, Z3_ast rm, Z3_ast t, Z3_sort s)
Conversion of a 2's complement unsigned bit-vector term into a term of FloatingPoint sort.

◆ udiv() [1/3]

expr udiv ( expr const a,
expr const b 
)
inline

unsigned division operator for bitvectors.

Definition at line 2398 of file z3++.h.

2398{ return to_expr(a.ctx(), Z3_mk_bvudiv(a.ctx(), a, b)); }
Z3_ast Z3_API Z3_mk_bvudiv(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned division.

Referenced by udiv(), and udiv().

◆ udiv() [2/3]

expr udiv ( expr const a,
int  b 
)
inline

Definition at line 2399 of file z3++.h.

2399{ return udiv(a, a.ctx().num_val(b, a.get_sort())); }
expr udiv(expr const &a, expr const &b)
unsigned division operator for bitvectors.
Definition z3++.h:2398

◆ udiv() [3/3]

expr udiv ( int  a,
expr const b 
)
inline

Definition at line 2400 of file z3++.h.

2400{ return udiv(b.ctx().num_val(a, b.get_sort()), b); }

◆ uge() [1/3]

expr uge ( expr const a,
expr const b 
)
inline

unsigned greater than or equal to operator for bitvectors.

Definition at line 2378 of file z3++.h.

2378{ return to_expr(a.ctx(), Z3_mk_bvuge(a.ctx(), a, b)); }

Referenced by uge(), and uge().

◆ uge() [2/3]

expr uge ( expr const a,
int  b 
)
inline

Definition at line 2379 of file z3++.h.

2379{ return uge(a, a.ctx().num_val(b, a.get_sort())); }
expr uge(expr const &a, expr const &b)
unsigned greater than or equal to operator for bitvectors.
Definition z3++.h:2378

◆ uge() [3/3]

expr uge ( int  a,
expr const b 
)
inline

Definition at line 2380 of file z3++.h.

2380{ return uge(b.ctx().num_val(a, b.get_sort()), b); }

◆ ugt() [1/3]

expr ugt ( expr const a,
expr const b 
)
inline

unsigned greater than operator for bitvectors.

Definition at line 2384 of file z3++.h.

2384{ return to_expr(a.ctx(), Z3_mk_bvugt(a.ctx(), a, b)); }
Z3_ast Z3_API Z3_mk_bvugt(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned greater than.

Referenced by ugt(), and ugt().

◆ ugt() [2/3]

expr ugt ( expr const a,
int  b 
)
inline

Definition at line 2385 of file z3++.h.

2385{ return ugt(a, a.ctx().num_val(b, a.get_sort())); }
expr ugt(expr const &a, expr const &b)
unsigned greater than operator for bitvectors.
Definition z3++.h:2384

◆ ugt() [3/3]

expr ugt ( int  a,
expr const b 
)
inline

Definition at line 2386 of file z3++.h.

2386{ return ugt(b.ctx().num_val(a, b.get_sort()), b); }

◆ ule() [1/3]

expr ule ( expr const a,
expr const b 
)
inline

unsigned less than or equal to operator for bitvectors.

Definition at line 2366 of file z3++.h.

2366{ return to_expr(a.ctx(), Z3_mk_bvule(a.ctx(), a, b)); }
Z3_ast Z3_API Z3_mk_bvule(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned less than or equal to.

Referenced by ule(), and ule().

◆ ule() [2/3]

expr ule ( expr const a,
int  b 
)
inline

Definition at line 2367 of file z3++.h.

2367{ return ule(a, a.ctx().num_val(b, a.get_sort())); }
expr ule(expr const &a, expr const &b)
unsigned less than or equal to operator for bitvectors.
Definition z3++.h:2366

◆ ule() [3/3]

expr ule ( int  a,
expr const b 
)
inline

Definition at line 2368 of file z3++.h.

2368{ return ule(b.ctx().num_val(a, b.get_sort()), b); }

◆ ult() [1/3]

expr ult ( expr const a,
expr const b 
)
inline

unsigned less than operator for bitvectors.

Definition at line 2372 of file z3++.h.

2372{ return to_expr(a.ctx(), Z3_mk_bvult(a.ctx(), a, b)); }
Z3_ast Z3_API Z3_mk_bvult(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned less than.

Referenced by ult(), and ult().

◆ ult() [2/3]

expr ult ( expr const a,
int  b 
)
inline

Definition at line 2373 of file z3++.h.

2373{ return ult(a, a.ctx().num_val(b, a.get_sort())); }
expr ult(expr const &a, expr const &b)
unsigned less than operator for bitvectors.
Definition z3++.h:2372

◆ ult() [3/3]

expr ult ( int  a,
expr const b 
)
inline

Definition at line 2374 of file z3++.h.

2374{ return ult(b.ctx().num_val(a, b.get_sort()), b); }

◆ urem() [1/3]

expr urem ( expr const a,
expr const b 
)
inline

unsigned reminder operator for bitvectors

Definition at line 2419 of file z3++.h.

2419{ return to_expr(a.ctx(), Z3_mk_bvurem(a.ctx(), a, b)); }
Z3_ast Z3_API Z3_mk_bvurem(Z3_context c, Z3_ast t1, Z3_ast t2)
Unsigned remainder.

Referenced by urem(), and urem().

◆ urem() [2/3]

expr urem ( expr const a,
int  b 
)
inline

Definition at line 2420 of file z3++.h.

2420{ return urem(a, a.ctx().num_val(b, a.get_sort())); }
expr urem(expr const &a, expr const &b)
unsigned reminder operator for bitvectors
Definition z3++.h:2419

◆ urem() [3/3]

expr urem ( int  a,
expr const b 
)
inline

Definition at line 2421 of file z3++.h.

2421{ return urem(b.ctx().num_val(a, b.get_sort()), b); }

◆ when()

tactic when ( probe const p,
tactic const t 
)
inline

Definition at line 3824 of file z3++.h.

3824 {
3825 check_context(p, t);
3826 Z3_tactic r = Z3_tactic_when(t.ctx(), p, t);
3827 t.check_error();
3828 return tactic(t.ctx(), r);
3829 }
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...

◆ with() [1/2]

simplifier with ( simplifier const t,
params const p 
)
inline

Definition at line 3546 of file z3++.h.

3546 {
3547 Z3_simplifier r = Z3_simplifier_using_params(t.ctx(), t, p);
3548 t.check_error();
3549 return simplifier(t.ctx(), r);
3550 }
Z3_simplifier Z3_API Z3_simplifier_using_params(Z3_context c, Z3_simplifier t, Z3_params p)
Return a simplifier that applies t using the given set of parameters.

◆ with() [2/2]

tactic with ( tactic const t,
params const p 
)
inline

Definition at line 3485 of file z3++.h.

3485 {
3486 Z3_tactic r = Z3_tactic_using_params(t.ctx(), t, p);
3487 t.check_error();
3488 return tactic(t.ctx(), r);
3489 }
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.

◆ xnor()

expr xnor ( expr const a,
expr const b 
)
inline

Definition at line 2161 of file z3++.h.

2161{ if (a.is_bool()) return !(a ^ b); check_context(a, b); Z3_ast r = Z3_mk_bvxnor(a.ctx(), a, b); a.check_error(); return expr(a.ctx(), r); }
Z3_ast Z3_API Z3_mk_bvxnor(Z3_context c, Z3_ast t1, Z3_ast t2)
Bitwise xnor.

◆ zext()

expr 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 2447 of file z3++.h.

2447{ return to_expr(a.ctx(), Z3_mk_zero_ext(a.ctx(), i, a)); }
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,...