details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.199564933777 seconds
cpu usage	0.140010915
max memory	1.265664E7

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: l8 0: l0 -> l1 : j^0'=j^post0, x1^0'=x1^post0, tmp3^0'=tmp3^post0, y2^0'=y2^post0, (0 == 0 /\ -j^0+x1^post0 == 0 /\ j^0-j^post0 == 0 /\ -1-j^0+y2^post0 == 0), cost: 1 1: l0 -> l1 : j^0'=j^post1, x1^0'=x1^post1, tmp3^0'=tmp3^post1, y2^0'=y2^post1, (-tmp3^post1+tmp3^0 == 0 /\ j^0-j^post1 == 0 /\ -x1^post1+x1^0 == 0 /\ -y2^post1+y2^0 == 0), cost: 1 8: l1 -> l6 : j^0'=j^post8, x1^0'=x1^post8, tmp3^0'=tmp3^post8, y2^0'=y2^post8, (-1-j^0+j^post8 == 0 /\ -y2^post8+y2^0 == 0 /\ -tmp3^post8+tmp3^0 == 0 /\ x1^0-x1^post8 == 0), cost: 1 2: l2 -> l3 : j^0'=j^post2, x1^0'=x1^post2, tmp3^0'=tmp3^post2, y2^0'=y2^post2, (-tmp3^post2+tmp3^0 == 0 /\ x1^0-x1^post2 == 0 /\ 4-j^0 <= 0 /\ -y2^post2+y2^0 == 0 /\ j^0-j^post2 == 0), cost: 1 3: l2 -> l0 : j^0'=j^post3, x1^0'=x1^post3, tmp3^0'=tmp3^post3, y2^0'=y2^post3, (j^0-j^post3 == 0 /\ x1^0-x1^post3 == 0 /\ -3+j^0 <= 0 /\ tmp3^0-tmp3^post3 == 0 /\ -y2^post3+y2^0 == 0), cost: 1 6: l3 -> l4 : j^0'=j^post6, x1^0'=x1^post6, tmp3^0'=tmp3^post6, y2^0'=y2^post6, (x1^0-x1^post6 == 0 /\ y2^0-y2^post6 == 0 /\ j^0-j^post6 == 0 /\ -tmp3^post6+tmp3^0 == 0), cost: 1 7: l3 -> l4 : j^0'=j^post7, x1^0'=x1^post7, tmp3^0'=tmp3^post7, y2^0'=y2^post7, (j^0-j^post7 == 0 /\ tmp3^0-tmp3^post7 == 0 /\ x1^0-x1^post7 == 0 /\ -y2^post7+y2^0 == 0), cost: 1 4: l4 -> l5 : j^0'=j^post4, x1^0'=x1^post4, tmp3^0'=tmp3^post4, y2^0'=y2^post4, (j^0-j^post4 == 0 /\ -y2^post4+y2^0 == 0 /\ -tmp3^post4+tmp3^0 == 0 /\ -x1^post4+x1^0 == 0), cost: 1 5: l6 -> l2 : j^0'=j^post5, x1^0'=x1^post5, tmp3^0'=tmp3^post5, y2^0'=y2^post5, (j^0-j^post5 == 0 /\ x1^0-x1^post5 == 0 /\ -y2^post5+y2^0 == 0 /\ -tmp3^post5+tmp3^0 == 0), cost: 1 9: l7 -> l6 : j^0'=j^post9, x1^0'=x1^post9, tmp3^0'=tmp3^post9, y2^0'=y2^post9, (-x1^post9+x1^0 == 0 /\ -y2^post9+y2^0 == 0 /\ -tmp3^post9+tmp3^0 == 0 /\ j^post9 == 0), cost: 1 10: l8 -> l7 : j^0'=j^post10, x1^0'=x1^post10, tmp3^0'=tmp3^post10, y2^0'=y2^post10, (-y2^post10+y2^0 == 0 /\ j^0-j^post10 == 0 /\ -tmp3^post10+tmp3^0 == 0 /\ x1^0-x1^post10 == 0), cost: 1 Removed unreachable rules and leafs Start location: l8 0: l0 -> l1 : j^0'=j^post0, x1^0'=x1^post0, tmp3^0'=tmp3^post0, y2^0'=y2^post0, (0 == 0 /\ -j^0+x1^post0 == 0 /\ j^0-j^post0 == 0 /\ -1-j^0+y2^post0 == 0), cost: 1 1: l0 -> l1 : j^0'=j^post1, x1^0'=x1^post1, tmp3^0'=tmp3^post1, y2^0'=y2^post1, (-tmp3^post1+tmp3^0 == 0 /\ j^0-j^post1 == 0 /\ -x1^post1+x1^0 == 0 /\ -y2^post1+y2^0 == 0), cost: 1 8: l1 -> l6 : j^0'=j^post8, x1^0'=x1^post8, tmp3^0'=tmp3^post8, y2^0'=y2^post8, (-1-j^0+j^post8 == 0 /\ -y2^post8+y2^0 == 0 /\ -tmp3^post8+tmp3^0 == 0 /\ x1^0-x1^post8 == 0), cost: 1 3: l2 -> l0 : j^0'=j^post3, x1^0'=x1^post3, tmp3^0'=tmp3^post3, y2^0'=y2^post3, (j^0-j^post3 == 0 /\ x1^0-x1^post3 == 0 /\ -3+j^0 <= 0 /\ tmp3^0-tmp3^post3 == 0 /\ -y2^post3+y2^0 == 0), cost: 1 5: l6 -> l2 : j^0'=j^post5, x1^0'=x1^post5, tmp3^0'=tmp3^post5, y2^0'=y2^post5, (j^0-j^post5 == 0 /\ x1^0-x1^post5 == 0 /\ -y2^post5+y2^0 == 0 /\ -tmp3^post5+tmp3^0 == 0), cost: 1 9: l7 -> l6 : j^0'=j^post9, x1^0'=x1^post9, tmp3^0'=tmp3^post9, y2^0'=y2^post9, (-x1^post9+x1^0 == 0 /\ -y2^post9+y2^0 == 0 /\ -tmp3^post9+tmp3^0 == 0 /\ j^post9 == 0), cost: 1 10: l8 -> l7 : j^0'=j^post10, x1^0'=x1^post10, tmp3^0'=tmp3^post10, y2^0'=y2^post10, (-y2^post10+y2^0 == 0 /\ j^0-j^post10 == 0 /\ -tmp3^post10+tmp3^0 == 0 /\ x1^0-x1^post10 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : j^0'=j^post0, x1^0'=x1^post0, tmp3^0'=tmp3^post0, y2^0'=y2^post0, (0 == 0 /\ -j^0+x1^post0 == 0 /\ j^0-j^post0 == 0 /\ -1-j^0+y2^post0 == 0), cost: 1 New rule: l0 -> l1 : x1^0'=j^0, tmp3^0'=tmp3^post0, y2^0'=1+j^0, 0 == 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : j^0'=j^post1, x1^0'=x1^post1, tmp3^0'=tmp3^post1, y2^0'=y2^post1, (-tmp3^post1+tmp3^0 == 0 /\ j^0-j^post1 == 0 /\ -x1^post1+x1^0 == 0 /\ -y2^post1+y2^0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : j^0'=j^post3, x1^0'=x1^post3, tmp3^0'=tmp3^post3, y2^0'=y2^post3, (j^0-j^post3 == 0 /\ x1^0-x1^post3 == 0 /\ -3+j^0 <= 0 /\ tmp3^0-tmp3^post3 == 0 /\ -y2^post3+y2^0 == 0), cost: 1 New rule: l2 -> l0 : -3+j^0 <= 0, cost: 1 Applied preprocessing Original rule: l6 -> l2 : j^0'=j^post5, x1^0'=x1^post5, tmp3^0'=tmp3^post5, y2^0'=y2^post5, (j^0-j^post5 == 0 /\ x1^0-x1^post5 == 0 /\ -y2^post5+y2^0 == 0 /\ -tmp3^post5+tmp3^0 == 0), cost: 1 New rule: l6 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l6 : j^0'=j^post8, x1^0'=x1^post8, tmp3^0'=tmp3^post8, y2^0'=y2^post8, (-1-j^0+j^post8 == 0 /\ -y2^post8+y2^0 == 0 /\ -tmp3^post8+tmp3^0 == 0 /\ x1^0-x1^post8 == 0), cost: 1 New rule: l1 -> l6 : j^0'=1+j^0, TRUE, cost: 1 Applied preprocessing Original rule: l7 -> l6 : j^0'=j^post9, x1^0'=x1^post9, tmp3^0'=tmp3^post9, y2^0'=y2^post9, (-x1^post9+x1^0 == 0 /\ -y2^post9+y2^0 == 0 /\ -tmp3^post9+tmp3^0 == 0 /\ j^post9 == 0), cost: 1 New rule: l7 -> l6 : j^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l8 -> l7 : j^0'=j^post10, x1^0'=x1^post10, tmp3^0'=tmp3^post10, y2^0'=y2^post10, (-y2^post10+y2^0 == 0 /\ j^0-j^post10 == 0 /\ -tmp3^post10+tmp3^0 == 0 /\ x1^0-x1^post10 == 0), cost: 1 New rule: l8 -> l7 : TRUE, cost: 1 Simplified rules Start location: l8 11: l0 -> l1 : x1^0'=j^0, tmp3^0'=tmp3^post0, y2^0'=1+j^0, 0 == 0, cost: 1 12: l0 -> l1 : TRUE, cost: 1 15: l1 -> l6 : j^0'=1+j^0, TRUE, cost: 1 13: l2 -> l0 : -3+j^0 <= 0, cost: 1 14: l6 -> l2 : TRUE, cost: 1 16: l7 -> l6 : j^0'=0, TRUE, cost: 1 17: l8 -> l7 : TRUE, cost: 1 Eliminating location l7 by chaining: Applied chaining First rule: l8 -> l7 : TRUE, cost: 1 Second rule: l7 -> l6 : j^0'=0, TRUE, cost: 1 New rule: l8 -> l6 : j^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 16 17 popout

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

job log

popout

actions

all output return to Integer Transition Systems