Benchmark
non-incremental/QF_UFBV/2018-Goel-hwbench/QF_UFBV_bv_bv_firewire_tree.1.prop2_ab_cti_max.smt2
Generated by the tool Averroes 2 (successor of [1]) which implements safety property
verification on hardware systems.
This SMT problem belongs to a set of SMT problems generated by applying Averroes 2
to benchmarks derived from [2-5].
A total of 412 systems (345 from [2], 19 from [3], 26 from [4], 22 from [5]) were
syntactically converted from their original formats (using [6, 7]), and given to
Averroes 2 to perform property checking with abstraction (wide bit-vectors -> terms,
wide operators -> UF) using SMT solvers [8, 9].
[1] Lee S., Sakallah K.A. (2014) Unbounded Scalable Verification Based on Approximate
Property-Directed Reachability and Datapath Abstraction. In: Biere A., Bloem R. (eds)
Computer Aided Verification. CAV 2014. Lecture Notes in Computer Science, vol 8559.
Springer, Cham
[2] http://fmv.jku.at/aiger/index.html#beem
[3] http://www.cs.cmu.edu/~modelcheck/vcegar
[4] http://www.cprover.org/hardware/v2c
[5] http://github.com/aman-goel/verilogbench
[6] http://www.clifford.at/yosys
[7] http://github.com/chengyinwu/V3
[8] http://github.com/Z3Prover/z3
[9] http://github.com/SRI-CSL/yices2
id: firewire_tree.1.prop2
query-maker: "Z3"
query-time: 3180.850000 ms
query-class: abstract
query-category: oneshot
query-type: cti
status: sat
mode: abstract_bv
| Benchmark |
|---|
| Size | 1867242 |
| Compressed Size | 178945 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2018-07-14 |
| Generated By | Aman Goel (amangoel@umich.edu), Karem A. Sakallah (karem@umich.edu) |
| Generated On | 2018-04-06 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | sat |
| Size | 1867234 |
| Compressed Size | 178965 |
| Max. Term Depth | 191 |
| Asserts | 15184 |
| Declared Functions | 6 |
| Declared Constants | 16225 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 72 |
ite | 14857 |
and | 6117 |
= | 36390 |
distinct | 72 |
let | 674 |
concat | 92 |
extract | 18 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2018
|
|
Boolector |
Boolector_default |
sat ✅
|
2.03789
|
2.03752
|
| |
CVC4 |
master-2018-06-10-b19c840-competition-default_default |
sat ✅
|
5.67252
|
5.67282
|
| |
MathSAT |
mathsat-5.5.2-linux-x86_64-Main_default |
sat ✅
|
3.71406
|
3.71498
|
| |
Yices2 |
Yices 2.6.0_default |
sat ✅
|
0.37261
|
0.37255
|
| |
Z3 |
z3-4.7.1_default |
sat ✅
|
1.10259
|
1.10249
|
|
SMT-COMP 2019
|
|
Boolector |
Boolector-wrapped-sq_default |
sat ✅
|
1.67960
|
1.67418
|
| |
|
Poolector-wrapped-sq_default |
sat ✅
|
1.99762
|
7.51999
|
| |
CVC4 |
CVC4-2019-06-03-d350fe1-wrapped-sq_default |
sat ✅
|
5.87809
|
5.87838
|
| |
Yices2 |
Yices 2.6.2-wrapped-sq_default |
sat ✅
|
0.33081
|
0.33079
|
| |
Z3 |
z3-4.8.4-d6df51951f4c-wrapped-sq_default |
sat ✅
|
1.08969
|
1.08962
|
|
SMT-COMP 2020
|
|
Bitwuzla |
Bitwuzla-fixed_default |
sat ✅
|
1.72788
|
1.72764
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
6.69957
|
6.69919
|
| |
MathSAT |
MathSAT5_default.sh |
sat ✅
|
5.61946
|
5.61887
|
| |
Yices2 |
Yices 2.6.2 bug fix_default |
sat ✅
|
0.32273
|
0.32261
|
| |
Z3 |
z3-4.8.8_default |
sat ✅
|
1.65859
|
1.65851
|
|
SMT-COMP 2021
|
|
MathSAT |
mathsat-5.6.6_default |
sat ✅
|
4.56337
|
4.56307
|
| |
Yices2 |
Yices 2.6.2 bug fix_default |
sat ✅
|
0.30364
|
0.30362
|
| |
|
Yices 2.6.2 for SMTCOMP2020_default |
sat ✅
|
0.30116
|
0.30109
|
| |
Z3 |
z3-4.8.11_default |
sat ✅
|
1.42709
|
1.42710
|
|
SMT-COMP 2024
|
|
Bitwuzla |
Bitwuzla |
sat ✅
|
1.50053
|
1.40094
|
| |
cvc5 |
cvc5 |
sat ✅
|
9.58306
|
9.48333
|
| |
SMTInterpol |
SMTInterpol |
sat ✅
|
1165.06315
|
1256.99202
|
| |
Yices2 |
Yices2 |
sat ✅
|
0.44821
|
0.34833
|
| |
Z3alpha |
Z3-alpha |
sat ✅
|
1.15456
|
1.05451
|