details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0869739 seconds
cpu usage	0.088373
user time	0.070737
system time	0.017636
max virtual memory	113188.0
max residence set size	18880.0

stage attributes

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

output

WORST_CASE(Omega(0),?) Initial ITS Start location: l6 0: l0 -> l1 : i5^0'=i5^post0, tmp^0'=tmp^post0, i^0'=i^post0, (i^post0 == 0 /\ i5^0-i5^post0 == 0 /\ tmp^0-tmp^post0 == 0 /\ 50-i5^0 <= 0), cost: 1 1: l0 -> l2 : i5^0'=i5^post1, tmp^0'=tmp^post1, i^0'=i^post1, (tmp^0-tmp^post1 == 0 /\ i^0-i^post1 == 0 /\ -49+i5^0 <= 0 /\ -1-i5^0+i5^post1 == 0), cost: 1 3: l1 -> l3 : i5^0'=i5^post3, tmp^0'=tmp^post3, i^0'=i^post3, (i^0-i^post3 == 0 /\ i5^0-i5^post3 == 0 /\ tmp^0-tmp^post3 == 0), cost: 1 2: l2 -> l0 : i5^0'=i5^post2, tmp^0'=tmp^post2, i^0'=i^post2, (tmp^0-tmp^post2 == 0 /\ i^0-i^post2 == 0 /\ i5^0-i5^post2 == 0), cost: 1 4: l3 -> l4 : i5^0'=i5^post4, tmp^0'=tmp^post4, i^0'=i^post4, (50-i^0 <= 0 /\ tmp^0-tmp^post4 == 0 /\ i^0-i^post4 == 0 /\ i5^0-i5^post4 == 0), cost: 1 5: l3 -> l1 : i5^0'=i5^post5, tmp^0'=tmp^post5, i^0'=i^post5, (-49+i^0 <= 0 /\ -1-i^0+i^post5 == 0 /\ i5^0-i5^post5 == 0 /\ tmp^0-tmp^post5 == 0), cost: 1 6: l5 -> l2 : i5^0'=i5^post6, tmp^0'=tmp^post6, i^0'=i^post6, (0 == 0 /\ i5^post6 == 0 /\ i^post6 == 0 /\ i5^10 == 0), cost: 1 7: l6 -> l5 : i5^0'=i5^post7, tmp^0'=tmp^post7, i^0'=i^post7, (i5^0-i5^post7 == 0 /\ tmp^0-tmp^post7 == 0 /\ i^0-i^post7 == 0), cost: 1 Removed unreachable rules and leafs Start location: l6 0: l0 -> l1 : i5^0'=i5^post0, tmp^0'=tmp^post0, i^0'=i^post0, (i^post0 == 0 /\ i5^0-i5^post0 == 0 /\ tmp^0-tmp^post0 == 0 /\ 50-i5^0 <= 0), cost: 1 1: l0 -> l2 : i5^0'=i5^post1, tmp^0'=tmp^post1, i^0'=i^post1, (tmp^0-tmp^post1 == 0 /\ i^0-i^post1 == 0 /\ -49+i5^0 <= 0 /\ -1-i5^0+i5^post1 == 0), cost: 1 3: l1 -> l3 : i5^0'=i5^post3, tmp^0'=tmp^post3, i^0'=i^post3, (i^0-i^post3 == 0 /\ i5^0-i5^post3 == 0 /\ tmp^0-tmp^post3 == 0), cost: 1 2: l2 -> l0 : i5^0'=i5^post2, tmp^0'=tmp^post2, i^0'=i^post2, (tmp^0-tmp^post2 == 0 /\ i^0-i^post2 == 0 /\ i5^0-i5^post2 == 0), cost: 1 5: l3 -> l1 : i5^0'=i5^post5, tmp^0'=tmp^post5, i^0'=i^post5, (-49+i^0 <= 0 /\ -1-i^0+i^post5 == 0 /\ i5^0-i5^post5 == 0 /\ tmp^0-tmp^post5 == 0), cost: 1 6: l5 -> l2 : i5^0'=i5^post6, tmp^0'=tmp^post6, i^0'=i^post6, (0 == 0 /\ i5^post6 == 0 /\ i^post6 == 0 /\ i5^10 == 0), cost: 1 7: l6 -> l5 : i5^0'=i5^post7, tmp^0'=tmp^post7, i^0'=i^post7, (i5^0-i5^post7 == 0 /\ tmp^0-tmp^post7 == 0 /\ i^0-i^post7 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : i5^0'=i5^post0, tmp^0'=tmp^post0, i^0'=i^post0, (i^post0 == 0 /\ i5^0-i5^post0 == 0 /\ tmp^0-tmp^post0 == 0 /\ 50-i5^0 <= 0), cost: 1 New rule: l0 -> l1 : i^0'=0, -50+i5^0 >= 0, cost: 1 Applied preprocessing Original rule: l0 -> l2 : i5^0'=i5^post1, tmp^0'=tmp^post1, i^0'=i^post1, (tmp^0-tmp^post1 == 0 /\ i^0-i^post1 == 0 /\ -49+i5^0 <= 0 /\ -1-i5^0+i5^post1 == 0), cost: 1 New rule: l0 -> l2 : i5^0'=1+i5^0, -49+i5^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : i5^0'=i5^post2, tmp^0'=tmp^post2, i^0'=i^post2, (tmp^0-tmp^post2 == 0 /\ i^0-i^post2 == 0 /\ i5^0-i5^post2 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l3 : i5^0'=i5^post3, tmp^0'=tmp^post3, i^0'=i^post3, (i^0-i^post3 == 0 /\ i5^0-i5^post3 == 0 /\ tmp^0-tmp^post3 == 0), cost: 1 New rule: l1 -> l3 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l1 : i5^0'=i5^post5, tmp^0'=tmp^post5, i^0'=i^post5, (-49+i^0 <= 0 /\ -1-i^0+i^post5 == 0 /\ i5^0-i5^post5 == 0 /\ tmp^0-tmp^post5 == 0), cost: 1 New rule: l3 -> l1 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1 Applied preprocessing Original rule: l5 -> l2 : i5^0'=i5^post6, tmp^0'=tmp^post6, i^0'=i^post6, (0 == 0 /\ i5^post6 == 0 /\ i^post6 == 0 /\ i5^10 == 0), cost: 1 New rule: l5 -> l2 : i5^0'=0, tmp^0'=tmp^post6, i^0'=0, 0 == 0, cost: 1 Applied preprocessing Original rule: l6 -> l5 : i5^0'=i5^post7, tmp^0'=tmp^post7, i^0'=i^post7, (i5^0-i5^post7 == 0 /\ tmp^0-tmp^post7 == 0 /\ i^0-i^post7 == 0), cost: 1 New rule: l6 -> l5 : TRUE, cost: 1 Simplified rules Start location: l6 8: l0 -> l1 : i^0'=0, -50+i5^0 >= 0, cost: 1 9: l0 -> l2 : i5^0'=1+i5^0, -49+i5^0 <= 0, cost: 1 11: l1 -> l3 : TRUE, cost: 1 10: l2 -> l0 : TRUE, cost: 1 12: l3 -> l1 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1 13: l5 -> l2 : i5^0'=0, tmp^0'=tmp^post6, i^0'=0, 0 == 0, cost: 1 14: l6 -> l5 : TRUE, cost: 1 Eliminating location l5 by chaining: Applied chaining First rule: l6 -> l5 : TRUE, cost: 1 Second rule: l5 -> l2 : i5^0'=0, tmp^0'=tmp^post6, i^0'=0, 0 == 0, cost: 1 New rule: l6 -> l2 : i5^0'=0, tmp^0'=tmp^post6, i^0'=0, 0 == 0, cost: 2 Applied deletion Removed the following rules: 13 14 Eliminating location l3 by chaining: Applied chaining First rule: l1 -> l3 : TRUE, cost: 1 Second rule: l3 -> l1 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1 New rule: l1 -> l1 : i^0'=1+i^0, -49+i^0 <= 0, cost: 2 popout

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

job log

popout

actions

all output return to ITS