Solving.UtilsSourceThis module declares all the types and signatures needed to implement an smt solver.
Qfuf is a logic with non-interpreted symbols, can be slow. Lra is linear arithmetic. Fast, but it requires an interpretation of CTS specification into linear arithmetic.
type env = {mk_theory : int -> Common.Oracle.theory;Compute a theory related to the target CTS specification.
*)min : int;minimum number of universes to check
*)max : int;maximum number of universes to check
*)print : bool;print the problem in a file
*)}configures the SMT solver
model is a function that associate to each fresh universe a concrete universe.