Questions tagged [smt]

Satisfiability Modulo Theories (SMT) are decision problems for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality.

Satisfiability Modulo Theories (SMT) are decision problems for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality.

A SMT instance is a generalization of a Boolean SAT instance in which various sets of variables are replaced by predicates from a variety of underlying theories.

SMT problems are usually expressed by the SMT-LIB language and solved by high-performance SMT solvers. For a list of benchmarks, solvers and other information regarding SMT, please visit http://smtlib.org/.

845 questions
0
votes
1 answer

Can z3 read the outputfile of MathSAT as its inputfile?

I need to conduct some experiments using z3 and mathsat. I have already finished the experiments with mathsat. It takes a lot of time to write the input file for mathsat and I don't want to write the input files for z3 again. Mathsat supports…
Dingbao Xie
  • 716
  • 9
  • 21
0
votes
2 answers

Returning unknown not sat/unsat with jsmtlib

Following this tutorial, I tried this first example in the tutorial. (set-option :print-success false) (set-logic QF_UF) (declare-fun p () Bool) (assert (and p (not p))) (check-sat) (exit) I executed this command java -jar jsmtlib.jar…
prosseek
  • 182,215
  • 215
  • 566
  • 871
0
votes
1 answer

Implement a formula that simulate the string Contains method

I'm trying to implement the String.Containts function. I have written some simple tests case, but the following one (which should return UNSAT) return SAT. The test try to match the substring 'bd' in the string 'abcd' by comparig all possible…
0mer
  • 45
  • 2
0
votes
1 answer

how to simplify the result of hiding variable using z3?

I wish to hide some variables and get the simplified results. I wish to hide c1, c2 and d as follows: (declare-const v1 Real) (declare-const v2 Real) (elim-quantifiers (exists ((c1 Real) (c2 Real)(d Real)) (and (<= c1…
user1487718
0
votes
1 answer

How to define a function in SMT 2.0 which returns the minimal value of 4 parameters

I'd like to define a function in SMT 2.0 that returns the minimal of 4 integer values.
-1
votes
0 answers

How often does Z3 internally call the Check() with its Linear Real Arithmetic Theory Solver?

I have been working on a linear real arithmetic theory solver for SymPy, an open source python library for symbolic computations. It's still a work in progress, but I've compared it with z3 on hundreds of random problems and it can handle equalities…
Tilo RC
  • 11
  • 2
-1
votes
1 answer

Z3 Python Mod Int Issue

I want to print primes below 20 using Z3. The following program prints 2, 3, 5, and 7, but not 11, 13, 17, or 19. Any idea what is wrong although isPrime(11), isPrime(13), isPrime(17), or isPrime(19) are all satisfied in my testing. from z3 import…
-1
votes
1 answer

How to find the same decimal number in hex using Z3 in python

My task is: input 10023678 (as a decimal number) output 10023678 (as a hex number:) I have solved this using the SMT-LIB formula in the bit-vector logic. But I would love to know how can I do it in python using the "import z3" .smt2 INPUT…
-1
votes
1 answer

Labeling constraints in Z3 Python API

Question 1: How could I use Z3 Python API in order to add constraints with unique labels? I was trying something like: ... self.solver.add(self.vm[i] >= 0, 'labelIdx'+str(self.idx)) ... where self.idx is an integer number which increases for each i,…
-1
votes
1 answer

defining a substitution box for AES in SMT solvers

How do I define a function which performs a substitution of values according to the table here? static const unsigned char FSb[256] = { 0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30, 0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76, 0xCA,…
meta_warrior
  • 389
  • 1
  • 6
  • 18
-1
votes
1 answer

Exclusive datatype in Z3

I tried to realize something in smtlib like a union in C: union IntBoolType { int i; boolean b; } x; My achievement so far: (declare-datatypes (Int) ((IntPart INone (part (i Int))))) (declare-datatypes (Bool) ((BoolPart BNone (part (b…
paubo147
  • 748
  • 4
  • 8
-2
votes
1 answer

How to use smt solver in CBMC(C Bounded Model Checking)?

I want to know how to use SMT Solver in CBMC. Generally we use minisat solver (SAT Solver) for constraint Solving in cbmc. But I want to use SMT Solvers for constraint solving in CBMC. I have gone through some references regarding the same, but…
-2
votes
1 answer

compilation and execution command for z3 in cpp?

#include #include #include"mainProj.cpp" using namespace std; using namespace z3; int main() { context c; tactic t = tactic(c, "bit-blast"); expr x = c.bv_const("x", 16); expr y = c.bv_const("y", 16); expr z =…
Viper
  • 121
  • 1
  • 7
-2
votes
1 answer

How can I use z3 in SMT-LIB format in java/eclipse?

Well, I can run z3 solver in eclipse with Java binding, and the using language is Java, but I need to use the SMT-LIB format to run z3 solver in eclipse, how can I make it ? I have research for something such as jSMTLIB Project, I don't know if it…
Jean Chen
  • 21
  • 4
-2
votes
1 answer

Guarantees about partial model when check-sat returns unknown

I have a question about partial models from z3. I have looked online for information about them, but sadly I have not found much, other than that they can sometimes be retrieved when a verification fails. In case (check-sat) returns unknown, what…
1 2 3
56
57