details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.1656229496 seconds
cpu usage	0.162266817
max memory	2.3048192E7

stage attributes

key	value
output-size	4690
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Initial ITS Start location: l4 0: l0 -> l1 : x^0'=x^post0, 1-x^0+x^post0 == 0, cost: 1 2: l0 -> l2 : x^0'=x^post2, (1-x^0+x^post2 == 0 /\ 1-x^post2 <= 0), cost: 1 1: l1 -> l0 : x^0'=x^post1, x^0-x^post1 == 0, cost: 1 3: l2 -> l0 : x^0'=x^post3, x^0-x^post3 == 0, cost: 1 4: l3 -> l0 : x^0'=x^post4, x^0-x^post4 == 0, cost: 1 5: l4 -> l3 : x^0'=x^post5, x^0-x^post5 == 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : x^0'=x^post0, 1-x^0+x^post0 == 0, cost: 1 New rule: l0 -> l1 : x^0'=-1+x^0, TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l0 : x^0'=x^post1, x^0-x^post1 == 0, cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l2 : x^0'=x^post2, (1-x^0+x^post2 == 0 /\ 1-x^post2 <= 0), cost: 1 New rule: l0 -> l2 : x^0'=-1+x^0, -2+x^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : x^0'=x^post3, x^0-x^post3 == 0, cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l0 : x^0'=x^post4, x^0-x^post4 == 0, cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l3 : x^0'=x^post5, x^0-x^post5 == 0, cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 6: l0 -> l1 : x^0'=-1+x^0, TRUE, cost: 1 8: l0 -> l2 : x^0'=-1+x^0, -2+x^0 >= 0, cost: 1 7: l1 -> l0 : TRUE, cost: 1 9: l2 -> l0 : TRUE, cost: 1 10: l3 -> l0 : TRUE, cost: 1 11: l4 -> l3 : TRUE, cost: 1 Eliminating location l3 by chaining: Applied chaining First rule: l4 -> l3 : TRUE, cost: 1 Second rule: l3 -> l0 : TRUE, cost: 1 New rule: l4 -> l0 : TRUE, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminating location l1 by chaining: Applied chaining First rule: l0 -> l1 : x^0'=-1+x^0, TRUE, cost: 1 Second rule: l1 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x^0'=-1+x^0, TRUE, cost: 2 Applied deletion Removed the following rules: 6 7 Eliminating location l2 by chaining: Applied chaining First rule: l0 -> l2 : x^0'=-1+x^0, -2+x^0 >= 0, cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x^0'=-1+x^0, -2+x^0 >= 0, cost: 2 popout

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

job log

popout

actions

all output return to Integer Transition Systems