Benchmark
non-incremental/FP/20200911-Pine/1599121862907643000.smt2
These benchmarks were generated while developing the tool Pine [1], which uses
CVC4/Z3 to check inductiveness of invariants. The work is described in [2].
[1] https://github.com/izycheva/pine
[2] A.Izycheva, E.Darulova, H.Seidl, SAS'20, "Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis"
Loop:
x1' := x1 + 0.01 * x2
x2' := -0.01 * x1 + 0.99 * x2
Input ranges:
x1 in [0.0,1.0]
x2 in [0.0,1.0]
Invariant:
-1.0*x1 + -0.41*x2 + 0.86*x1^2 + 0.3*x1*x2 + 0.83*x2^2 <= 0.67
and
x1 in [-0.5,1.5]
x2 in [-1.0,1.0]
Query: Loop and Invariant and not Invariant'
| Benchmark |
| Size | 3954 |
| Compressed Size | 1176 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2021-07-18 |
| Generated By | Anastasiia Izycheva, Eva Darulova |
| Generated On | 2020-09-11 00:00:00 |
| Generator | Pine (using Z3 Python API) |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unknown |
| Inferred Status | sat |
| Size | 3946 |
| Compressed Size | 1181 |
| Max. Term Depth | 30 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 4 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 6 |
let | 26 |
fp | 23 |
fp.add | 10 |
fp.mul | 19 |
fp.neg | 1 |
fp.leq | 10 |
fp.eq | 2 |
roundNearestTiesToEven | 29 |
| | | |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2024
|
|
Bitwuzla |
Bitwuzla |
sat ✅
|
37.09086
|
36.97823
|
| |
cvc5 |
cvc5 |
sat ✅
|
1052.54938
|
1052.42029
|
|
SMT-COMP 2025
|
0.33 (2/3) |
Bitwuzla |
Bitwuzla |
sat ✅
|
28.52697
|
28.37754
|
| |
cvc5 |
cvc5 |
sat ✅
|
250.80983
|
250.64799
|
| |
UltimateEliminator |
UltimateEliminator+MathSAT |
unknown ❌
|
1201.80948
|
1205.53433
|