Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF

Model checking invariant properties of designs, represented as transition systems, with non-linear real arithmetic (NRA), is an important though very hard problem. On the one hand NRA is a hard-to-solve theory; on the other hand most of the powerful model checking techniques lack support for NRA. In this paper, we present a counterexample-guided abstraction refinement (CEGAR) approach that leverages linearization techniques from differential calculus to enable the use of mature and efficient model checking algorithms for transition systems on linear real arithmetic (LRA) with uninterpreted functions (EUF). The results of an empirical evaluation confirm the validity and potential of this approach.

[1]  Bruno Dutertre,et al.  Yices 2.2 , 2014, CAV.

[2]  Wei Chen,et al.  dReach: δ-Reachability Analysis for Hybrid Systems , 2015, TACAS.

[3]  Bernd Becker,et al.  Advancing Software Model Checking Beyond Linear Arithmetic Theories , 2016, Haifa Verification Conference.

[4]  R. M. Hueschen,et al.  Development of the Transport Class Model (TCM) Aircraft Simulation From a Sub-Scale Generic Transport Model (GTM) Simulation , 2011 .

[5]  Sagar Chaki,et al.  SMT-based model checking for recursive programs , 2014, Formal Methods in System Design.

[6]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[7]  Alessandro Cimatti,et al.  A quantifier-free SMT encoding of non-linear hybrid automata , 2012, 2012 Formal Methods in Computer-Aided Design (FMCAD).

[8]  Alberto Griggio,et al.  IC3 Modulo Theories via Implicit Predicate Abstraction , 2013, TACAS.

[9]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[10]  Edmund M. Clarke,et al.  dReal: An SMT Solver for Nonlinear Theories over the Reals , 2013, CADE.

[11]  Nikolaj Bjørner,et al.  Generalized Property Directed Reachability , 2012, SAT.

[12]  David Monniaux,et al.  Polyhedral Approximation of Multivariate Polynomials Using Handelman's Theorem , 2016, VMCAI.

[13]  Ashish Tiwari,et al.  Time-Aware Abstractions in HybridSal , 2015, CAV.

[14]  Leonardo Mendonça de Moura,et al.  Solving non-linear arithmetic , 2012, ACCA.

[15]  Alberto L. Sangiovanni-Vincentelli,et al.  CalCS: SMT solving for non-linear convex constraints , 2010, Formal Methods in Computer Aided Design.

[16]  Alberto Griggio,et al.  HyComp: An SMT-Based Model Checker for Hybrid Systems , 2015, TACAS.

[17]  Marco Roveri,et al.  The nuXmv Symbolic Model Checker , 2014, CAV.

[18]  M. Gario,et al.  PySMT: a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms , 2015 .

[19]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[20]  Bernd Becker,et al.  Craig Interpolation in the Presence of Non-linear Constraints , 2011, FORMATS.

[21]  Bernd Becker,et al.  Recent Improvements in the SMT Solver iSAT , 2013, MBMV.

[22]  Sergiy Bogomolov,et al.  HYST: a source transformation and translation tool for hybrid automaton models , 2015, HSCC.

[23]  Georg Weissenbacher,et al.  Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR) , 2014, CAV.

[24]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition--preliminary report , 1974, SIGS.

[25]  Erika Ábrahám,et al.  A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra , 2010, Verification over discrete-continuous boundaries.

[26]  Daniel Kroening,et al.  Interpolation-Based Verification of Floating-Point Programs with Abstract CDCL , 2013, SAS.

[27]  Temesghen Kahsai,et al.  Verifying the Safety of a Flight-Critical System , 2015, FM.

[28]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[29]  Cesare Tinelli,et al.  CoCoSpec: A Mode-Aware Contract Language for Reactive Systems , 2016, SEFM.

[30]  Niklas Sörensson,et al.  Temporal induction by incremental SAT solving , 2003, BMC@CAV.