Benchmark
non-incremental/QF_BVFPLRA/20190429-UltimateAutomizerSvcomp2019/digits_bad_for_false-unreach-call.i_3.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 | 2094 |
| Compressed Size | 1079 |
| 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 | unknown |
| Inferred Status | sat |
| Size | 2086 |
| Compressed Size | 1083 |
| Max. Term Depth | 10 |
| Asserts | 2 |
| Declared Functions | 0 |
| Declared Constants | 2 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 2 |
or | 1 |
= | 1 |
let | 1 |
bvmul | 1 |
fp.sub | 1 |
fp.mul | 1 |
fp.eq | 2 |
roundNearestTiesToEven | 1 |
roundTowardZero | 1 |
fp.to_sbv | 1 |
to_fp | 3 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2020
|
0.50 (2/4) |
COLIBRI |
COLIBRI 20.5.25_default |
unknown ❌
|
0.31080
|
0.31078
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.81895
|
0.81920
|
| |
MathSAT |
MathSAT5_default.sh |
sat ✅
|
1.07083
|
1.07078
|
|
SMT-COMP 2021
|
0.50 (2/4) |
COLIBRI |
COLIBRI_21_06_23_default |
unknown ❌
|
0.32447
|
0.32492
|
| |
|
COLIBRI 20.5.25_default |
unknown ❌
|
0.31357
|
0.31338
|
| |
|
COLIBRI_21_05_28_default |
unknown ❌
|
0.32460
|
0.32511
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.80384
|
0.80415
|
| |
MathSAT |
mathsat-5.6.6_default |
sat ✅
|
0.98209
|
0.98196
|
|
SMT-COMP 2022
|
0.20 (4/5) |
Bitwuzla |
Bitwuzla-wrapped_default |
sat ✅
|
0.07494
|
0.07489
|
| |
COLIBRI |
COLIBRI 22_06_18_default |
unknown ❌
|
0.32666
|
0.32672
|
| |
cvc5 |
cvc5_default |
sat ✅
|
0.76803
|
0.76862
|
| |
|
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
0.71570
|
0.71626
|
| |
MathSAT |
MathSAT-5.6.8_default |
sat ✅
|
0.99569
|
0.99556
|
| |
Z3 |
z3-4.8.17_default |
sat ✅
|
0.95687
|
0.95855
|
|
SMT-COMP 2023
|
0.67 (1/3) |
Bitwuzla |
Bitwuzla-fixed_default |
sat ✅
|
0.12834
|
0.12828
|
| |
COLIBRI |
COLIBRI 2023_05_10_default |
unknown ❌
|
0.34297
|
0.34345
|
| |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
unknown ❌
|
0.04346
|
0.04384
|
|
SMT-COMP 2024
|
0.67 (1/3) |
Bitwuzla |
Bitwuzla |
sat ✅
|
0.27323
|
0.17352
|
| |
COLIBRI |
COLIBRI |
unknown ❌
|
0.46140
|
0.36185
|
| |
cvc5 |
cvc5 |
unknown ❌
|
0.23975
|
0.13980
|
|
SMT-COMP 2025
|
0.25 (3/4) |
Bitwuzla |
Bitwuzla |
sat ✅
|
0.35460
|
0.23263
|
| |
COLIBRI |
COLIBRI |
unknown ❌
|
0.48627
|
0.36041
|
| |
Colibri2 |
colibri2 |
sat ✅
|
4.09417
|
3.96495
|
| |
cvc5 |
cvc5 |
sat ✅
|
0.72023
|
0.60407
|