details

property	value
status	complete
benchmark	arith.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n082.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.393275976181 seconds
cpu usage	0.388817585
max memory	1.2972032E7

stage attributes

key	value
output-size	7199
starexec-result	WORST_CASE(Omega(0),?)

output

/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: l4 0: l0 -> l1 : nondet!13^0'=nondet!13^post0, temp0!15^0'=temp0!15^post0, x!20^0'=x!20^post0, result!12^0'=result!12^post0, x!14^0'=x!14^post0, (0 == 0 /\ -nondet!13^10+x!14^post0 == 0 /\ x!20^0-x!20^post0 == 0 /\ -result!12^post0+result!12^0 == 0 /\ temp0!15^0-temp0!15^post0 == 0), cost: 1 1: l1 -> l2 : nondet!13^0'=nondet!13^post1, temp0!15^0'=temp0!15^post1, x!20^0'=x!20^post1, result!12^0'=result!12^post1, x!14^0'=x!14^post1, (-temp0!15^post1+temp0!15^0 == 0 /\ -x!14^post1+x!14^0 == 0 /\ nondet!13^0-nondet!13^post1 == 0 /\ -temp0!15^0+result!12^post1 == 0 /\ x!14^0 <= 0 /\ x!20^0-x!20^post1 == 0), cost: 1 2: l1 -> l3 : nondet!13^0'=nondet!13^post2, temp0!15^0'=temp0!15^post2, x!20^0'=x!20^post2, result!12^0'=result!12^post2, x!14^0'=x!14^post2, (1-x!20^0+x!14^post2 <= 0 /\ nondet!13^0-nondet!13^post2 == 0 /\ temp0!15^0-temp0!15^post2 == 0 /\ -x!20^post2+x!20^0 == 0 /\ -1+x!20^0-x!14^post2 <= 0 /\ 1-x!20^0 <= 0 /\ 1+x!14^post2-x!14^0 == 0 /\ -result!12^post2+result!12^0 == 0 /\ 1-x!14^0 <= 0), cost: 1 3: l3 -> l1 : nondet!13^0'=nondet!13^post3, temp0!15^0'=temp0!15^post3, x!20^0'=x!20^post3, result!12^0'=result!12^post3, x!14^0'=x!14^post3, (nondet!13^0-nondet!13^post3 == 0 /\ x!20^0-x!20^post3 == 0 /\ result!12^0-result!12^post3 == 0 /\ temp0!15^0-temp0!15^post3 == 0 /\ -x!14^post3+x!14^0 == 0), cost: 1 4: l4 -> l0 : nondet!13^0'=nondet!13^post4, temp0!15^0'=temp0!15^post4, x!20^0'=x!20^post4, result!12^0'=result!12^post4, x!14^0'=x!14^post4, (-x!14^post4+x!14^0 == 0 /\ -result!12^post4+result!12^0 == 0 /\ temp0!15^0-temp0!15^post4 == 0 /\ -x!20^post4+x!20^0 == 0 /\ nondet!13^0-nondet!13^post4 == 0), cost: 1 Removed unreachable rules and leafs Start location: l4 0: l0 -> l1 : nondet!13^0'=nondet!13^post0, temp0!15^0'=temp0!15^post0, x!20^0'=x!20^post0, result!12^0'=result!12^post0, x!14^0'=x!14^post0, (0 == 0 /\ -nondet!13^10+x!14^post0 == 0 /\ x!20^0-x!20^post0 == 0 /\ -result!12^post0+result!12^0 == 0 /\ temp0!15^0-temp0!15^post0 == 0), cost: 1 2: l1 -> l3 : nondet!13^0'=nondet!13^post2, temp0!15^0'=temp0!15^post2, x!20^0'=x!20^post2, result!12^0'=result!12^post2, x!14^0'=x!14^post2, (1-x!20^0+x!14^post2 <= 0 /\ nondet!13^0-nondet!13^post2 == 0 /\ temp0!15^0-temp0!15^post2 == 0 /\ -x!20^post2+x!20^0 == 0 /\ -1+x!20^0-x!14^post2 <= 0 /\ 1-x!20^0 <= 0 /\ 1+x!14^post2-x!14^0 == 0 /\ -result!12^post2+result!12^0 == 0 /\ 1-x!14^0 <= 0), cost: 1 3: l3 -> l1 : nondet!13^0'=nondet!13^post3, temp0!15^0'=temp0!15^post3, x!20^0'=x!20^post3, result!12^0'=result!12^post3, x!14^0'=x!14^post3, (nondet!13^0-nondet!13^post3 == 0 /\ x!20^0-x!20^post3 == 0 /\ result!12^0-result!12^post3 == 0 /\ temp0!15^0-temp0!15^post3 == 0 /\ -x!14^post3+x!14^0 == 0), cost: 1 4: l4 -> l0 : nondet!13^0'=nondet!13^post4, temp0!15^0'=temp0!15^post4, x!20^0'=x!20^post4, result!12^0'=result!12^post4, x!14^0'=x!14^post4, (-x!14^post4+x!14^0 == 0 /\ -result!12^post4+result!12^0 == 0 /\ temp0!15^0-temp0!15^post4 == 0 /\ -x!20^post4+x!20^0 == 0 /\ nondet!13^0-nondet!13^post4 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : nondet!13^0'=nondet!13^post0, temp0!15^0'=temp0!15^post0, x!20^0'=x!20^post0, result!12^0'=result!12^post0, x!14^0'=x!14^post0, (0 == 0 /\ -nondet!13^10+x!14^post0 == 0 /\ x!20^0-x!20^post0 == 0 /\ -result!12^post0+result!12^0 == 0 /\ temp0!15^0-temp0!15^post0 == 0), cost: 1 New rule: l0 -> l1 : nondet!13^0'=nondet!13^post0, x!14^0'=nondet!13^10, 0 == 0, cost: 1 Applied preprocessing Original rule: l1 -> l3 : nondet!13^0'=nondet!13^post2, temp0!15^0'=temp0!15^post2, x!20^0'=x!20^post2, result!12^0'=result!12^post2, x!14^0'=x!14^post2, (1-x!20^0+x!14^post2 <= 0 /\ nondet!13^0-nondet!13^post2 == 0 /\ temp0!15^0-temp0!15^post2 == 0 /\ -x!20^post2+x!20^0 == 0 /\ -1+x!20^0-x!14^post2 <= 0 /\ 1-x!20^0 <= 0 /\ 1+x!14^post2-x!14^0 == 0 /\ -result!12^post2+result!12^0 == 0 /\ 1-x!14^0 <= 0), cost: 1 New rule: l1 -> l3 : x!14^0'=-1+x!20^0, (x!20^0-x!14^0 == 0 /\ 1-x!14^0 <= 0), cost: 1 Applied preprocessing Original rule: l3 -> l1 : nondet!13^0'=nondet!13^post3, temp0!15^0'=temp0!15^post3, x!20^0'=x!20^post3, result!12^0'=result!12^post3, x!14^0'=x!14^post3, (nondet!13^0-nondet!13^post3 == 0 /\ x!20^0-x!20^post3 == 0 /\ result!12^0-result!12^post3 == 0 /\ temp0!15^0-temp0!15^post3 == 0 /\ -x!14^post3+x!14^0 == 0), cost: 1 New rule: l3 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l0 : nondet!13^0'=nondet!13^post4, temp0!15^0'=temp0!15^post4, x!20^0'=x!20^post4, result!12^0'=result!12^post4, x!14^0'=x!14^post4, (-x!14^post4+x!14^0 == 0 /\ -result!12^post4+result!12^0 == 0 /\ temp0!15^0-temp0!15^post4 == 0 /\ -x!20^post4+x!20^0 == 0 /\ nondet!13^0-nondet!13^post4 == 0), cost: 1 New rule: l4 -> l0 : TRUE, cost: 1 Simplified rules Start location: l4 5: l0 -> l1 : nondet!13^0'=nondet!13^post0, x!14^0'=nondet!13^10, 0 == 0, cost: 1 6: l1 -> l3 : x!14^0'=-1+x!20^0, (x!20^0-x!14^0 == 0 /\ 1-x!14^0 <= 0), cost: 1 7: l3 -> l1 : TRUE, cost: 1 8: l4 -> l0 : TRUE, cost: 1 Eliminating location l0 by chaining: Applied chaining First rule: l4 -> l0 : TRUE, cost: 1 Second rule: l0 -> l1 : nondet!13^0'=nondet!13^post0, x!14^0'=nondet!13^10, 0 == 0, cost: 1 New rule: l4 -> l1 : nondet!13^0'=nondet!13^post0, x!14^0'=nondet!13^10, 0 == 0, cost: 2 Applied deletion Removed the following rules: 5 8 Eliminating location l3 by chaining: Applied chaining First rule: l1 -> l3 : x!14^0'=-1+x!20^0, (x!20^0-x!14^0 == 0 /\ 1-x!14^0 <= 0), cost: 1 Second rule: l3 -> l1 : TRUE, cost: 1 New rule: l1 -> l1 : x!14^0'=-1+x!20^0, (x!20^0-x!14^0 == 0 /\ 1-x!14^0 <= 0), cost: 2 Applied deletion Removed the following rules: 6 7 Eliminated locations on linear paths Start location: l4 10: l1 -> l1 : x!14^0'=-1+x!20^0, (x!20^0-x!14^0 == 0 /\ 1-x!14^0 <= 0), cost: 2 9: l4 -> l1 : nondet!13^0'=nondet!13^post0, x!14^0'=nondet!13^10, 0 == 0, cost: 2 Accelerated simple loops Start location: l4 10: l1 -> l1 : x!14^0'=-1+x!20^0, (x!20^0-x!14^0 == 0 /\ 1-x!14^0 <= 0), cost: 2 9: l4 -> l1 : nondet!13^0'=nondet!13^post0, x!14^0'=nondet!13^10, 0 == 0, cost: 2 Applied chaining First rule: l4 -> l1 : nondet!13^0'=nondet!13^post0, x!14^0'=nondet!13^10, 0 == 0, cost: 2 Second rule: l1 -> l1 : x!14^0'=-1+x!20^0, (x!20^0-x!14^0 == 0 /\ 1-x!14^0 <= 0), cost: 2 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Integer Transition Systems