Learning SMT(LRA) Constraints using SMT Solvers

We introduce the problem of learning SMT(LRA)constraints from data. SMT(LRA) extends propositional logic with (in)equalities between numerical variables. Many relevant formal verification problems can be cast as SMT(LRA) instances and SMT (LRA) has supported recent developments in optimization and counting for hybrid Booleanand numerical domains. We introduce SMT(LRA) learning, the task of learning SMT (LRA) formulas from examples of feasible and infeasible instances, and we contribute INCAL, an exact non-greedy algorithm for this setting. Our approach encodes the learning task itself as an SMT(LRA) satisfiability problem that can be solved directly by SMT solvers.INCAL is an incremental algorithm that achieves exact learning by looking only at a small subset ofthe data, leading to significant speed-ups. We empirically evaluate our approach on both synthetic instances and benchmark problems taken from the SMT-LIB benchmarks repositor.