Benchmark
incremental/UFDTNIA/20201212-Barrett/loops.smt2
From the test suite for the Move Prover, a verifier for smart contracts in the
Move programming language. A paper about the tool is here:
https://doi.org/10.1007/978-3-030-53288-8_7
The Move Prover code and tests are available at:
https://github.com/diem/diem/tree/main/language/move-prover
The benchmarks were generated using the master branch and standard test suite
as of Dec 17, 2020. Submitted by Clark Barrett <barrett@cs.stanford.edu>.
| Status | unsat |
| Inferred Status | None |
| Size | 36134 |
| Compressed Size | 6082 |
| Max. Term Depth | 42 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 34 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 19 |
false | 7 |
Bool | 1 |
ite | 26 |
not | 12 |
or | 12 |
and | 111 |
=> | 84 |
= | 153 |
forall | 61 |
let | 58 |
Int | 55 |
div | 1 |
+ | 12 |
- | 12 |
* | 1 |
< | 20 |
<= | 37 |
> | 2 |
>= | 21 |
| Status | unknown |
| Inferred Status | None |
| Size | 38962 |
| Compressed Size | 6261 |
| Max. Term Depth | 42 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 58 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 16 |
false | 10 |
Bool | 1 |
ite | 26 |
not | 12 |
or | 12 |
and | 111 |
=> | 84 |
= | 153 |
forall | 61 |
let | 58 |
Int | 55 |
div | 1 |
+ | 12 |
- | 12 |
* | 1 |
< | 20 |
<= | 37 |
> | 2 |
>= | 21 |
| Status | unsat |
| Inferred Status | None |
| Size | 33965 |
| Compressed Size | 5798 |
| Max. Term Depth | 27 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 71 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 14 |
false | 14 |
Bool | 1 |
ite | 26 |
not | 9 |
or | 12 |
and | 81 |
=> | 63 |
= | 128 |
forall | 61 |
let | 45 |
Int | 55 |
div | 1 |
+ | 9 |
- | 11 |
* | 1 |
< | 20 |
<= | 28 |
> | 2 |
>= | 15 |
| Status | unsat |
| Inferred Status | None |
| Size | 34923 |
| Compressed Size | 5860 |
| Max. Term Depth | 27 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 84 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 18 |
false | 10 |
Bool | 1 |
ite | 26 |
not | 9 |
or | 12 |
and | 81 |
=> | 63 |
= | 128 |
forall | 61 |
let | 45 |
Int | 55 |
div | 1 |
+ | 9 |
- | 11 |
* | 1 |
< | 20 |
<= | 28 |
> | 2 |
>= | 15 |
| Status | unsat |
| Inferred Status | None |
| Size | 41945 |
| Compressed Size | 6500 |
| Max. Term Depth | 44 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 108 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 17 |
false | 10 |
Bool | 1 |
ite | 26 |
not | 12 |
or | 12 |
and | 112 |
=> | 87 |
= | 156 |
forall | 61 |
let | 60 |
Int | 55 |
div | 1 |
+ | 12 |
- | 13 |
* | 1 |
< | 20 |
<= | 37 |
> | 3 |
>= | 21 |
| Status | unknown |
| Inferred Status | None |
| Size | 44609 |
| Compressed Size | 6622 |
| Max. Term Depth | 44 |
| Asserts | 63 |
| Declared Functions | 50 |
| Declared Constants | 132 |
| Declared Sorts | 6 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 8 |
Symbols
true | 20 |
false | 7 |
Bool | 1 |
ite | 26 |
not | 12 |
or | 12 |
and | 112 |
=> | 87 |
= | 156 |
forall | 61 |
let | 60 |
Int | 55 |
div | 1 |
+ | 12 |
- | 13 |
* | 1 |
< | 20 |
<= | 37 |
> | 3 |
>= | 21 |