Benchmark
non-incremental/QF_ABVFP/20170428-Liew-KLEE/imperial_synthetic_memcpy_and_use_as_bitvector_klee.x86_64/query.077.smt2
Corresponding query: An equisatisfiable query (arrays replaced with bitvectors) is available at QF_BVFP/20170428-Liew-KLEE/imperial_synthetic_memcpy_and_use_as_bitvector_klee.x86_64/query.077.smt2
| Benchmark |
|---|
| Size | 1168 |
| Compressed Size | 663 |
| 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 | sat |
| Inferred Status | sat |
| Size | 1160 |
| Compressed Size | 664 |
| Max. Term Depth | 9 |
| 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
ite | 1 |
not | 1 |
= | 1 |
let | 2 |
concat | 3 |
bvslt | 2 |
select | 4 |
fp.add | 1 |
roundNearestTiesToEven | 1 |
to_fp | 3 |
| | | |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2018
|
|
COLIBRI |
COLIBRI 10_06_18 v2038_default |
sat ✅
|
0.29585
|
0.29608
|
| |
CVC4 |
master-2018-06-10-b19c840-competition-default_default |
sat ✅
|
0.06731
|
0.06745
|