Benchmark
non-incremental/QF_BVFP/20170428-Liew-KLEE/imperial_synthetic_memcpy_and_check_all_ones_significand_klee_double.x86_64/query.5.smt2
Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_ABVFP/20170428-Liew-KLEE/imperial_synthetic_memcpy_and_check_all_ones_significand_klee_double.x86_64/query.5.smt2
| Benchmark |
|---|
| Size | 1697 |
| Compressed Size | 776 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2017-07-23 |
| Generated By | Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl |
| Generated On | — |
| Generator | KLEE |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unsat |
| Inferred Status | unsat |
| Size | 1689 |
| Compressed Size | 765 |
| Max. Term Depth | 9 |
| Asserts | 5 |
| Declared Functions | 0 |
| Declared Constants | 3 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
ite | 2 |
not | 2 |
= | 5 |
let | 4 |
bvand | 2 |
fp.add | 3 |
fp.gt | 1 |
fp.isInfinite | 1 |
roundNearestTiesToEven | 3 |
to_fp | 9 |
| | | |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2017
|
0.33 (2/3) |
COLIBRI |
COLIBRI 18_06_2017 105a81 default |
unsat ✅
|
0.27569
|
0.27498
|
| |
Z3 |
z3-4.5.0 default |
unsat ✅
|
0.03796
|
0.03700
|
|
SMT-COMP 2018
|
|
COLIBRI |
COLIBRI 10_06_18 v2038_default |
unsat ✅
|
0.29398
|
0.29406
|
| |
CVC4 |
master-2018-06-10-b19c840-competition-default_default |
unsat ✅
|
0.11979
|
0.11994
|
| |
Z3 |
z3-4.7.1_default |
unsat ✅
|
0.64896
|
0.64884
|