details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.279169 seconds
cpu usage	0.286632
user time	0.250594
system time	0.036038
max virtual memory	113188.0
max residence set size	19272.0

stage attributes

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

output

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

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

job log

popout

actions

all output return to ITS