Benchmark
non-incremental/QF_NRA/LassoRanker/CooperatingT2/p-46.t2.c_Iteration2_Loop_3-pieceTemplate.smt2
SMT script generated by Ultimate LassoRanker [1]
Ultimate LassoRanker is a tool that synthesizes ranking functions for
linear lasso programs and implements the techniques presented in [2] and [3].
For generating these SMT scripts Ultimate LassoRanker was used as a sub
procedure of the termination analyzer Ultimate BuchiAutomizer [4] which
implements the techniques presented in [5].
This SMT script belongs to a set of SMT scripts that was generated by applying
revision 11505 of BuchiAutomizer to
- the benchmarks from the demonstration category on termination of the SV-COMP
2014 [6] available at [7],
- the benchmarks from [8] which are available at [9] and,
- benchmarks from the repository of Ultimate LassoRanker.
This set of SMT scripts contains only SMT scripts that we considered to be
difficult because LassoRanker run into a timeout after 10 seconds.
2014-05-03, Matthias Heizmann (heizmann@informatik.uni-freiburg.de)
[1] http://ultimate.informatik.uni-freiburg.de/LassoRanker/
[2] Jan Leike and Matthias Heizmann. Ranking Templates for Linear Loops. In
TACAS 2014.
[3] Matthias Heizmann, Jochen Hoenicke, Jan Leike and Andreas Podelski. Linear
Ranking for Linear Lasso Programs. In ATVA 2013.
[4] http://ultimate.informatik.uni-freiburg.de/BuchiAutomizer/
[5] Matthias Heizmann, Jochen Hoenicke and Andreas Podelski. Termination
Analysis by Learning Terminating Programs. Accepted at CAV 2014
[6] Dirk Beyer: Status Report on Software Verification - (Competition Summary
SV-COMP 2014). TACAS 2014
[7] https://svn.sosy-lab.org/software/sv-benchmarks/trunk/c/termination-crafted/
[8] Marc Brockschmidt, Byron Cook, Carsten Fuhs: Better Termination Proving
through Cooperation. CAV 2013:413-429
[9] http://verify.rwth-aachen.de/brockschmidt/Cooperating-T2/
| Benchmark |
|---|
| Size | 645788 |
| Compressed Size | 30770 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2014-07-21 |
| Generated By | — |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unknown |
| Inferred Status | unsat |
| Size | 645780 |
| Compressed Size | 30774 |
| Max. Term Depth | 10 |
| Asserts | 313 |
| Declared Functions | 0 |
| Declared Constants | 3199 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
or | 860 |
and | 312 |
= | 4104 |
let | 584 |
+ | 5738 |
- | 4258 |
* | 10424 |
< | 312 |
<= | 312 |
> | 313 |
>= | 3044 |
| |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2017
|
0.80 (1/5) |
CVC4 |
CVC4-smtcomp2017-main default |
unsat ✅
|
327.01300
|
326.65700
|
| |
SMT-RAT |
SMTRAT-comp2017_2 default |
unknown ❌
|
600.01200
|
600.01600
|
| |
veriT |
veriT+raSAT+Redlog default |
unknown ❌
|
600.07000
|
401.50000
|
| |
Yices2 |
Yices2-Main default |
unknown ❌
|
600.02200
|
599.96000
|
| |
Z3 |
z3-4.5.0 default |
unknown ❌
|
600.01500
|
599.81000
|
|
SMT-COMP 2018
|
0.80 (1/5) |
CVC4 |
master-2018-06-10-b19c840-competition-default_default |
unsat ✅
|
44.82750
|
44.82890
|
| |
SMT-RAT |
SMTRAT-Rat-final_default |
unknown ❌
|
1200.02000
|
1199.77000
|
| |
|
SMTRAT-MCSAT-final_default |
unknown ❌
|
1200.11000
|
1199.87000
|
| |
veriT |
veriT+raSAT+Reduce_default |
unknown ❌
|
1200.02000
|
1199.95000
|
| |
Yices2 |
Yices 2.6.0_default |
unknown ❌
|
1200.01000
|
1199.99000
|
| |
Z3 |
z3-4.7.1_default |
unknown ❌
|
1200.01000
|
1199.91000
|
|
SMT-COMP 2024
|
0.60 (2/5) |
cvc5 |
cvc5 |
unsat ✅
|
249.28067
|
249.10674
|
| |
SMTInterpol |
SMTInterpol |
unknown ❌
|
2.74026
|
7.71739
|
| |
SMT-RAT |
SMT-RAT |
unknown ❌
|
1201.71141
|
1201.06419
|
| |
Yices2 |
Yices2 |
unknown ❌
|
1201.26790
|
1201.03442
|
| |
Z3alpha |
Z3-alpha |
unsat ✅
|
75.82825
|
75.72610
|