details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.256644010544 seconds
cpu usage	0.257862275
max memory	1.2967936E7

stage attributes

key	value
output-size	14775
starexec-result	NO

output

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

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

job log

popout

actions

all output return to Integer Transition Systems