PySMT 0.4.1

A solver-agnostic library for SMT Formulae manipulation and solving

pySMT makes working with Satisfiability Modulo Theory simple.

Among others, you can:

• Define formulae in a solver independent way in a simple and inutitive way,

• Write ad-hoc simplifiers and operators,

• Dump your problems in the SMT-Lib format,

• Solve them using one of the native solvers, or by wrapping any SMT-Lib complaint solver.

Supported Theories and Solvers

pySMT provides methods to define a formula in Linear Real Arithmetic (LRA), Real Difference Logic (RDL), their combination (LIRA), Equalities and Uninterpreted Functions (EUF) and Bit-Vectors (BV). The following solvers are supported through native APIs:

• MathSAT (http://mathsat.fbk.eu/)

• Z3 (http://z3.codeplex.com/releases)

• CVC4 (http://cvc4.cs.nyu.edu/web/)

• Yices 2 (http://yices.csl.sri.com/)

• CUDD (http://vlsi.colorado.edu/~fabio/CUDD/)

• PicoSAT (http://fmv.jku.at/picosat/)

Additionally, you can use any SMT-LIB 2 compliant solver.

PySMT assumes that the python bindings for the SMT Solver are installed and accessible from your PYTHONPATH. For Yices 2 we rely on pyices (https://github.com/cheshire/pyices), for CUDD on repycudd (https://github.com/pysmt/repycudd).

pySMT works on both Python 2 and Python 3. Some solvers support both versions (e.g., MathSAT) but in general, many solvers still support only Python 2.

Wanna know more?

Visit http://www.pysmt.org