Z3

I am trying to solve a problem similar to the one here ( Z3: finding all satisfying models ) where I need to find all satisfying assignments of SMT formulae that contain set variables. I understand the idea in the link since it is similar to what some SAT solvers do to iterate through solutions: add the negation of the solution to obtain a different solution. However, when I use the set variables (which are implemented as arrays in Z3) the things get a little complicated or perhaps I miss something. Assume that I have two constraints added to the solver as follows: EnumSort rSort = ctx

I'm using Z3 with Java API. In my SMT-LIB2 file, there are several variables: (declare-fun x0 () Int) (declare-fun x1 () Bool) ; alot more I want to get all these variables, and store them in an array of Expr . From the example distributed with z3, I find the API SMTLIBDecls that get declarations parsed from an SMT-LIB1 file, but there is no similar API for SMT-LIB2. How can I get the declarations? Thanks. Christoph Wintersteiger There is currently no function for this purpose, but it is easy to get the declarations by traversing the expressions. This has previously been asked for C/C++, but

I am running into some performance issues in my current project with Z3 for Java: Basically most of my current constraints are pretty simple: e.g: (f(x) = 2 && f(y) <= 3) || f(x) <=5 I am using static context and solver instances shared by the whole project: public class ConstraintManager { static Context ctx; static Solver solver; ... } If I generate expr by the same instance of ctx for billions of times, is that going to an issue? When is the best time to invoke ctx.Dispose() , or, what's the best way to manage ctx? I invoked expr.Simplify() to simplify some constraints like: f(x)=3 && f(x)<

I am using z3 v 4.1. I am using the C++ API and I am trying to add some array constraints in the context. I dont see the select and sort functions in the C++ API. I tried mixing of the C and C++ API. In the example array_example1() provided with the C API if I change the context variable from Z3_Context (i.e. C API) to context (i.e. C++ API) I get a segmentation fault at the "create antecedent" statement void array_example1(){ context ctx; //Z3_context ctx; Z3_sort int_sort, array_sort; Z3_ast a1, a2, i1, v1, i2, v2, i3; Z3_ast st1, st2, sel1, sel2; Z3_ast antecedent, consequent; Z3_ast ds[3];

Recent versions of Z3 have decoupled the notions of Z3_context and Z3_solver . The API mostly reflects these changes; for instance push is deprecated on contexts and respecified as taking a solver as an extra argument. The interface for theories has not been updated, however. Theories are still created from contexts, and as far as I can tell, never explicitly attached to solvers. One could think that a theory created from a context will always be attached to all solvers created from the context, but it seems from our experience that this is not the case. Instead, user-defined theories seem to

In fact, does the SMT-LIB standard have a rational (not just real) sort? Going by its website , it does not. If x is a rational and we have a constraint x^2 = 2, then we should get back ``unsatisfiable''. The closest I could get to encoding that constraint is the following: ;;(set-logic QF_NRA) ;; intentionally commented out (declare-const x Real) (assert (= (* x x) 2.0)) (check-sat) (get-model) for which z3 returns a solution, as there is a solution (irrational) in the reals. I do understand that z3 has its own rational library, which it uses, for instance, when solving QF_LRA constraints