details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.071004152298 seconds
cpu usage	0.067889438
max memory	1.25952E7

stage attributes

key	value
output-size	6704
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: l5 0: l0 -> l1 : p^0'=p^post0, y_1^0'=y_1^post0, (y_1^0-y_1^post0 == 0 /\ p^0-p^post0 == 0), cost: 1 1: l1 -> l0 : p^0'=p^post1, y_1^0'=y_1^post1, (-y_1^post1+y_1^0 == 0 /\ p^0-p^post1 == 0), cost: 1 2: l2 -> l3 : p^0'=p^post2, y_1^0'=y_1^post2, (-y_1^post2+y_1^0 == 0 /\ p^post2 == 0), cost: 1 3: l3 -> l4 : p^0'=p^post3, y_1^0'=y_1^post3, (p^0-p^post3 == 0 /\ 1-y_1^0 <= 0 /\ 1-y_1^0+y_1^post3 == 0), cost: 1 5: l3 -> l0 : p^0'=p^post5, y_1^0'=y_1^post5, (y_1^0-y_1^post5 == 0 /\ y_1^0 <= 0 /\ 1+p^post5 == 0), cost: 1 4: l4 -> l3 : p^0'=p^post4, y_1^0'=y_1^post4, (p^0-p^post4 == 0 /\ -y_1^post4+y_1^0 == 0), cost: 1 6: l5 -> l2 : p^0'=p^post6, y_1^0'=y_1^post6, (-y_1^post6+y_1^0 == 0 /\ p^0-p^post6 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : p^0'=p^post0, y_1^0'=y_1^post0, (y_1^0-y_1^post0 == 0 /\ p^0-p^post0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l0 : p^0'=p^post1, y_1^0'=y_1^post1, (-y_1^post1+y_1^0 == 0 /\ p^0-p^post1 == 0), cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l3 : p^0'=p^post2, y_1^0'=y_1^post2, (-y_1^post2+y_1^0 == 0 /\ p^post2 == 0), cost: 1 New rule: l2 -> l3 : p^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l4 : p^0'=p^post3, y_1^0'=y_1^post3, (p^0-p^post3 == 0 /\ 1-y_1^0 <= 0 /\ 1-y_1^0+y_1^post3 == 0), cost: 1 New rule: l3 -> l4 : y_1^0'=-1+y_1^0, -1+y_1^0 >= 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : p^0'=p^post4, y_1^0'=y_1^post4, (p^0-p^post4 == 0 /\ -y_1^post4+y_1^0 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l0 : p^0'=p^post5, y_1^0'=y_1^post5, (y_1^0-y_1^post5 == 0 /\ y_1^0 <= 0 /\ 1+p^post5 == 0), cost: 1 New rule: l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1 Applied preprocessing Original rule: l5 -> l2 : p^0'=p^post6, y_1^0'=y_1^post6, (-y_1^post6+y_1^0 == 0 /\ p^0-p^post6 == 0), cost: 1 New rule: l5 -> l2 : TRUE, cost: 1 Simplified rules Start location: l5 7: l0 -> l1 : TRUE, cost: 1 8: l1 -> l0 : TRUE, cost: 1 9: l2 -> l3 : p^0'=0, TRUE, cost: 1 10: l3 -> l4 : y_1^0'=-1+y_1^0, -1+y_1^0 >= 0, cost: 1 12: l3 -> l0 : p^0'=-1, y_1^0 <= 0, cost: 1 11: l4 -> l3 : TRUE, cost: 1 13: l5 -> l2 : TRUE, cost: 1 Eliminating location l2 by chaining: Applied chaining First rule: l5 -> l2 : TRUE, cost: 1 Second rule: l2 -> l3 : p^0'=0, TRUE, cost: 1 New rule: l5 -> l3 : p^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 9 13 Eliminating location l4 by chaining: Applied chaining First rule: l3 -> l4 : y_1^0'=-1+y_1^0, -1+y_1^0 >= 0, cost: 1 Second rule: l4 -> l3 : TRUE, cost: 1 New rule: l3 -> l3 : y_1^0'=-1+y_1^0, -1+y_1^0 >= 0, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminating location l1 by chaining: popout

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

job log

popout

actions

all output return to Integer Transition Systems