Benchmark
non-incremental/QF_BVFPLRA/20190429-UltimateAutomizerSvcomp2019/newton_1_7_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 | 4536 |
| Compressed Size | 1430 |
| 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 | 4528 |
| Compressed Size | 1426 |
| 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 |
/ | 2 |
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.50 (2/4) |
COLIBRI |
COLIBRI 20.5.25_default |
sat ✅
|
2.64857
|
2.63210
|
| |
CVC4 |
CVC4-sq-final_default |
unknown ❌
|
1200.03000
|
1199.91000
|
| |
MathSAT |
MathSAT5_default.sh |
sat ✅
|
4.17381
|
4.17354
|
|
SMT-COMP 2021
|
0.50 (2/4) |
COLIBRI |
COLIBRI_21_06_23_default |
sat ✅
|
0.98986
|
0.99029
|
| |
|
COLIBRI 20.5.25_default |
sat ✅
|
4.12189
|
4.12236
|
| |
|
COLIBRI_21_05_28_default |
sat ✅
|
0.99999
|
1.00043
|
| |
CVC4 |
CVC4-sq-final_default |
unknown ❌
|
1200.03000
|
1199.79000
|
| |
MathSAT |
mathsat-5.6.6_default |
sat ✅
|
3.85357
|
3.85309
|
|
SMT-COMP 2022
|
|
Bitwuzla |
Bitwuzla-wrapped_default |
sat ✅
|
0.63422
|
0.63393
|
| |
COLIBRI |
COLIBRI 22_06_18_default |
sat ✅
|
1.15203
|
1.15207
|
| |
cvc5 |
cvc5_default |
sat ✅
|
12.23400
|
12.23400
|
| |
|
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
2.66784
|
2.66259
|
| |
MathSAT |
MathSAT-5.6.8_default |
sat ✅
|
4.24835
|
4.24804
|
| |
Z3 |
z3-4.8.17_default |
sat ✅
|
8.70338
|
8.70531
|
|
SMT-COMP 2023
|
|
Bitwuzla |
Bitwuzla-fixed_default |
sat ✅
|
0.98119
|
0.98089
|
| |
COLIBRI |
COLIBRI 2023_05_10_default |
sat ✅
|
1.17697
|
1.17733
|
| |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
sat ✅
|
2.99054
|
2.99082
|
|
SMT-COMP 2024
|
|
Bitwuzla |
Bitwuzla |
sat ✅
|
2.93564
|
2.83368
|
| |
COLIBRI |
COLIBRI |
sat ✅
|
1.31863
|
1.18521
|
| |
cvc5 |
cvc5 |
sat ✅
|
2.40252
|
2.30254
|
|
SMT-COMP 2025
|
|
Bitwuzla |
Bitwuzla |
sat ✅
|
3.40447
|
3.27512
|
| |
COLIBRI |
COLIBRI |
sat ✅
|
1.46542
|
1.34602
|
| |
Colibri2 |
colibri2 |
sat ✅
|
0.47744
|
0.34869
|
| |
cvc5 |
cvc5 |
sat ✅
|
2.02350
|
1.90711
|