details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0098201 seconds
cpu usage	0.007662
user time	9.1E-4
system time	0.006752
max virtual memory	0.0
max residence set size	3028.0

stage attributes

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

output

WORST_CASE(Omega(0),?) Initial ITS Start location: l2 0: l0 -> l1 : rt_11^0'=rt_11^post0, x_13^0'=x_13^post0, st_14^0'=st_14^post0, (1-x_13^0+x_13^post0 == 0 /\ -x_13^0 <= 0 /\ rt_11^post0-st_14^0 == 0 /\ -st_14^post0+st_14^0 == 0), cost: 1 1: l0 -> l1 : rt_11^0'=rt_11^post1, x_13^0'=x_13^post1, st_14^0'=st_14^post1, (x_13^0-x_13^post1 == 0 /\ st_14^0-st_14^post1 == 0 /\ rt_11^post1-st_14^0 == 0 /\ 1+x_13^0 <= 0), cost: 1 2: l2 -> l0 : rt_11^0'=rt_11^post2, x_13^0'=x_13^post2, st_14^0'=st_14^post2, (x_13^0-x_13^post2 == 0 /\ st_14^0-st_14^post2 == 0 /\ rt_11^0-rt_11^post2 == 0), cost: 1 Removed unreachable rules and leafs Start location: l2 <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