details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0986080169678 seconds
cpu usage	0.053422148
max memory	1.4680064E7

stage attributes

key	value
output-size	4649
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 : i^0'=i^post0, (3-i^0 <= 0 /\ i^0-i^post0 == 0), cost: 1 1: l0 -> l2 : i^0'=i^post1, (-1-i^0+i^post1 == 0 /\ -2+i^0 <= 0), cost: 1 7: l1 -> l6 : i^0'=i^post7, i^0-i^post7 == 0, cost: 1 5: l2 -> l3 : i^0'=i^post5, i^0-i^post5 == 0, cost: 1 2: l3 -> l0 : i^0'=i^post2, i^0-i^post2 == 0, cost: 1 3: l3 -> l0 : i^0'=i^post3, i^0-i^post3 == 0, cost: 1 4: l3 -> l1 : i^0'=i^post4, i^0-i^post4 == 0, cost: 1 6: l4 -> l5 : i^0'=i^post6, i^0-i^post6 == 0, cost: 1 8: l6 -> l4 : i^0'=i^post8, (-1+i^0 <= 0 /\ i^0-i^post8 == 0), cost: 1 9: l6 -> l4 : i^0'=i^post9, (2-i^0 <= 0 /\ i^0-i^post9 == 0), cost: 1 10: l7 -> l2 : i^0'=i^post10, i^post10 == 0, cost: 1 11: l8 -> l7 : i^0'=i^post11, i^0-i^post11 == 0, cost: 1 Removed unreachable rules and leafs Start location: l8 1: l0 -> l2 : i^0'=i^post1, (-1-i^0+i^post1 == 0 /\ -2+i^0 <= 0), cost: 1 5: l2 -> l3 : i^0'=i^post5, i^0-i^post5 == 0, cost: 1 2: l3 -> l0 : i^0'=i^post2, i^0-i^post2 == 0, cost: 1 3: l3 -> l0 : i^0'=i^post3, i^0-i^post3 == 0, cost: 1 10: l7 -> l2 : i^0'=i^post10, i^post10 == 0, cost: 1 11: l8 -> l7 : i^0'=i^post11, i^0-i^post11 == 0, cost: 1 Applied preprocessing Original rule: l0 -> l2 : i^0'=i^post1, (-1-i^0+i^post1 == 0 /\ -2+i^0 <= 0), cost: 1 New rule: l0 -> l2 : i^0'=1+i^0, -2+i^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l0 : i^0'=i^post2, i^0-i^post2 == 0, cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l0 : i^0'=i^post3, i^0-i^post3 == 0, cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l3 : i^0'=i^post5, i^0-i^post5 == 0, cost: 1 New rule: l2 -> l3 : TRUE, cost: 1 Applied preprocessing Original rule: l7 -> l2 : i^0'=i^post10, i^post10 == 0, cost: 1 New rule: l7 -> l2 : i^0'=0, TRUE, cost: 1 Applied preprocessing Original rule: l8 -> l7 : i^0'=i^post11, i^0-i^post11 == 0, cost: 1 New rule: l8 -> l7 : TRUE, cost: 1 Applied deletion Removed the following rules: 13 Simplified rules Start location: l8 12: l0 -> l2 : i^0'=1+i^0, -2+i^0 <= 0, cost: 1 15: l2 -> l3 : TRUE, cost: 1 14: l3 -> l0 : TRUE, cost: 1 16: l7 -> l2 : i^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 -> l2 : i^0'=0, TRUE, cost: 1 New rule: l8 -> l2 : i^0'=0, TRUE, cost: 2 Applied deletion Removed the following rules: 16 17 Eliminating location l3 by chaining: Applied chaining First rule: l2 -> l3 : TRUE, cost: 1 popout

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

job log

popout

actions

all output return to Integer Transition Systems