Benchmark
non-incremental/QF_UFLIA/20230314-Jaroslav-Bendik-Certora/3106_1c933134166dbad31f79_38_QF_UFLIA.smt2
Publications: https://docs.certora.com/en/latest/docs/whitepaper/index.html
This benchmarkset was produced by the Certora Prover, i.e. a tool for
formal verification of Ethereum Smart Contracts. The benchmarks encode
verification conditions for real Smart Contracts (programs) written by
Certora customers.
The Certora Prover uses various strategies and SMT encodings of the
underlying verification problem. In most cases, we use either LIA,
NIA or BV encodings, where:
1. LIA is typically an overapproximation of the underlying verification
problem.
2. NIA is typically a precise encoding.
3. BV is required when the input contains non-trivial bitwise operations
that we do not model precisely with NIA (i.e., in these cases, NIA
is an overapproximation).
Note that our specification language allows unbounded integers
(i.e. mathints); this the reason why we need NIA and LIA instead of
using just BV.
We also use various encodings of "underlying hashing functions"; the
two main encodings we use rely on i) UF and ii) on UFDT. Therefore,
given a single input (a smart contract and a specification), we typically
produce 6 different encodings: QF_UFNIA, QF_UFLIA, QF_UFBV, QF_UFDTNIA,
QF_UFDTLIA, and QF_UFDTBV. The 462 benchmarks in this benchmark set
originate from 77 unique smart contracts and specifications (77*6 =
462) and can be mapped based on the common name-prefix of the files. For
instances:
./QF_UFBV/20230314-Jaroslav-Bendik-Certora/940_590f27b1c3c800d3243e_33_QF_UFBV.smt2
./QF_UFDTLIA/20230314-Jaroslav-Bendik-Certora/940_590f27b1c3c800d3243e_33_QF_UFDTLIA.smt2
./QF_UFLIA/20230314-Jaroslav-Bendik-Certora/940_590f27b1c3c800d3243e_33_QF_UFLIA.smt2
./QF_UFDTBV/20230314-Jaroslav-Bendik-Certora/940_590f27b1c3c800d3243e_33_QF_UFDTBV.smt2
./QF_UFDTNIA/20230314-Jaroslav-Bendik-Certora/940_590f27b1c3c800d3243e_33_QF_UFDTNIA.smt2
./QF_UFNIA/20230314-Jaroslav-Bendik-Certora/940_590f27b1c3c800d3243e_33_QF_UFNIA.smt2
| Benchmark |
|---|
| Size | 6190323 |
| Compressed Size | 828447 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2023-07-06 |
| Generated By | Jaroslav Bendik |
| Generated On | 2023-03-14 00:00:00 |
| Generator | Certora Prover |
| Dolmen OK | 1 |
| strict Dolmen OK | — |
| check-sat calls | 1 |
| Status | unknown |
| Inferred Status | None |
| Size | 6190315 |
| Compressed Size | 828453 |
| Max. Term Depth | 16 |
| Asserts | 40201 |
| Declared Functions | 49 |
| Declared Constants | 2041 |
| Declared Sorts | 0 |
| Defined Functions | 364 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 20 |
false | 4 |
Bool | 77 |
ite | 521 |
not | 36025 |
or | 193 |
and | 2803 |
=> | 23426 |
= | 45198 |
let | 13 |
Int | 287 |
+ | 124562 |
- | 725 |
* | 818 |
< | 566 |
<= | 10601 |
> | 289 |
>= | 10657 |
| | | |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2024
|
1.00 (0/4) |
cvc5 |
cvc5 |
unknown ❌
|
1201.72094
|
1201.11527
|
| |
OpenSMT |
OpenSMT |
unknown ❌
|
1201.24161
|
1200.59110
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
1201.71286
|
1307.51601
|
| |
Yices2 |
Yices2 |
unknown ❌
|
1201.41326
|
1201.27982
|