details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0116869 seconds
cpu usage	0.009583
user time	0.006329
system time	0.003254
max virtual memory	0.0
max residence set size	3708.0

stage attributes

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

output

WORST_CASE(Omega(0),?) Initial ITS Start location: l6 0: l0 -> l1 : a^0'=a^post0, b^0'=b^post0, (b^0-b^post0 == 0 /\ 1 <= 0 /\ a^0-a^post0 == 0), cost: 1 2: l0 -> l2 : a^0'=a^post2, b^0'=b^post2, (b^post2 == 0 /\ a^0-a^post2 == 0), cost: 1 1: l1 -> l0 : a^0'=a^post1, b^0'=b^post1, (-b^post1+b^0 == 0 /\ a^0-a^post1 == 0), cost: 1 3: l2 -> l3 : a^0'=a^post3, b^0'=b^post3, (a^0-a^post3 == 0 /\ b^0 <= 0 /\ b^0-b^post3 == 0), cost: 1 4: l4 -> l0 : a^0'=a^post4, b^0'=b^post4, (a^0 <= 0 /\ a^0-a^post4 == 0 /\ -b^post4+b^0 == 0), cost: 1 5: l4 -> l2 : a^0'=a^post5, b^0'=b^post5, (-1+b^post5 == 0 /\ a^0-a^post5 == 0), cost: 1 6: l5 -> l4 : a^0'=a^post6, b^0'=b^post6, (-1+a^post6 == 0 /\ -b^post6+b^0 == 0), cost: 1 7: l6 -> l5 : a^0'=a^post7, b^0'=b^post7, (a^0-a^post7 == 0 /\ -b^post7+b^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l6 0: l0 -> l1 : a^0'=a^post0, b^0'=b^post0, (b^0-b^post0 == 0 /\ 1 <= 0 /\ a^0-a^post0 == 0), cost: 1 1: l1 -> l0 : a^0'=a^post1, b^0'=b^post1, (-b^post1+b^0 == 0 /\ a^0-a^post1 == 0), cost: 1 4: l4 -> l0 : a^0'=a^post4, b^0'=b^post4, (a^0 <= 0 /\ a^0-a^post4 == 0 /\ -b^post4+b^0 == 0), cost: 1 6: l5 -> l4 : a^0'=a^post6, b^0'=b^post6, (-1+a^post6 == 0 /\ -b^post6+b^0 == 0), cost: 1 7: l6 -> l5 : a^0'=a^post7, b^0'=b^post7, (a^0-a^post7 == 0 /\ -b^post7+b^0 == 0), cost: 1 Removed rules with unsatisfiable guard Start location: l6 1: l1 -> l0 : a^0'=a^post1, b^0'=b^post1, (-b^post1+b^0 == 0 /\ a^0-a^post1 == 0), cost: 1 4: l4 -> l0 : a^0'=a^post4, b^0'=b^post4, (a^0 <= 0 /\ a^0-a^post4 == 0 /\ -b^post4+b^0 == 0), cost: 1 6: l5 -> l4 : a^0'=a^post6, b^0'=b^post6, (-1+a^post6 == 0 /\ -b^post6+b^0 == 0), cost: 1 7: l6 -> l5 : a^0'=a^post7, b^0'=b^post7, (a^0-a^post7 == 0 /\ -b^post7+b^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l6 <empty> Computing asymptotic complexity Proved the following lower bound Complexity: Unknown Cpx degree: ? Solved cost: 0 Rule cost: 0 popout

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

job log

popout

actions

all output return to ITS