Benchmark
non-incremental/QF_BVFPLRA/20190429-UltimateAutomizerSvcomp2019/newton_1_5_false-unreach-call_true-termination.i_AllErrorsAtOnce_Iteration1_TraceCheck_0.smt2
|
Generated by the tool Ultimate Automizer [1,2] which implements
an automata theoretic approach [3] to software verification.
This SMT script belongs to a set of SMT scripts that was generated by
applying Ultimate Automizer to benchmarks [4] from the SV-COMP 2019 [5,6].
This script might _not_ contain all SMT commands that are used by
Ultimate Automizer. In order to satisfy the restrictions of
the SMT-COMP we have to drop e.g., the commands for getting
values (resp. models), unsatisfiable cores and interpolants.
2019-04-27, Matthias Heizmann (heizmann@informatik.uni-freiburg.de)
[1] https://ultimate.informatik.uni-freiburg.de/automizer/
[2] Matthias Heizmann, Yu-Fang Chen, Daniel Dietsch, Marius Greitschus,
Jochen Hoenicke, Yong Li, Alexander Nutz, Betim Musa, Christian
Schilling, Tanja Schindler, Andreas Podelski: Ultimate Automizer
and the Search for Perfect Interpolants - (Competition Contribution).
TACAS (2) 2018: 447-451
[3] Matthias Heizmann, Jochen Hoenicke, Andreas Podelski: Software Model
Checking for People Who Love Automata. CAV 2013:36-52
[4] https://github.com/sosy-lab/sv-benchmarks
[5] Dirk Beyer: Automatic Verification of C and Java Programs: SV-COMP 2019.
TACAS (3) 2019: 133-155
[6] https://sv-comp.sosy-lab.org/2019/
|
| Benchmark |
|---|
| Size | 4530 |
| Compressed Size | 1432 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2020-07-06 |
| Generated By | — |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | sat |
| Size | 4522 |
| Compressed Size | 1421 |
| Max. Term Depth | 9 |
| Asserts | 16 |
| Declared Functions | 0 |
| Declared Constants | 15 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
false | 1 |
ite | 1 |
not | 3 |
and | 1 |
= | 14 |
let | 5 |
/ | 1 |
fp.add | 4 |
fp.sub | 3 |
fp.mul | 11 |
fp.div | 7 |
fp.neg | 1 |
fp.lt | 2 |
fp.gt | 1 |
roundNearestTiesToEven | 1 |
to_fp | 10 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2020
|
0.25 (3/4) |
COLIBRI |
COLIBRI 20.5.25_default |
sat ✅
|
2.64602
|
2.64631
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
274.22700
|
274.21700
|
| |
MathSAT |
MathSAT5_default.sh |
sat ✅
|
6.75740
|
6.75694
|
|
SMT-COMP 2021
|
0.25 (3/4) |
COLIBRI |
COLIBRI_21_06_23_default |
sat ✅
|
1.17644
|
1.17625
|
| |
|
COLIBRI 20.5.25_default |
sat ✅
|
2.64086
|
2.64080
|
| |
|
COLIBRI_21_05_28_default |
sat ✅
|
1.17549
|
1.17584
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
322.25500
|
322.20600
|
| |
MathSAT |
mathsat-5.6.6_default |
sat ✅
|
100.75000
|
100.74400
|
|
SMT-COMP 2022
|
|
Bitwuzla |
Bitwuzla-wrapped_default |
sat ✅
|
0.77639
|
0.77592
|
| |
COLIBRI |
COLIBRI 22_06_18_default |
sat ✅
|
1.32765
|
1.32770
|
| |
cvc5 |
cvc5_default |
sat ✅
|
10.98330
|
10.98250
|
| |
|
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
2.70147
|
2.69786
|
| |
MathSAT |
MathSAT-5.6.8_default |
sat ✅
|
33.73180
|
33.72920
|
| |
Z3 |
z3-4.8.17_default |
sat ✅
|
30.98830
|
30.98700
|
|
SMT-COMP 2023
|
|
Bitwuzla |
Bitwuzla-fixed_default |
sat ✅
|
1.06500
|
1.06487
|
| |
COLIBRI |
COLIBRI 2023_05_10_default |
sat ✅
|
1.36682
|
1.36709
|
| |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
sat ✅
|
18.35070
|
18.35150
|
|
SMT-COMP 2024
|
|
Bitwuzla |
Bitwuzla |
sat ✅
|
3.31108
|
3.20977
|
| |
COLIBRI |
COLIBRI |
sat ✅
|
1.38615
|
1.28535
|
| |
cvc5 |
cvc5 |
sat ✅
|
3.00462
|
2.90323
|
|
SMT-COMP 2025
|
|
Bitwuzla |
Bitwuzla |
sat ✅
|
2.12408
|
1.99835
|
| |
COLIBRI |
COLIBRI |
sat ✅
|
1.23358
|
1.11500
|
| |
Colibri2 |
colibri2 |
sat ✅
|
0.39896
|
0.27849
|
| |
cvc5 |
cvc5 |
sat ✅
|
1.68444
|
1.55485
|