details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.0140559673309 seconds
cpu usage	0.009892637
max memory	917504.0

stage attributes

key	value
output-size	868
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: l2 0: l0 -> l1 : a^0'=a^post0, x2^0'=x2^post0, ret_incr3^0'=ret_incr3^post0, (x2^post0-a^10 == 0 /\ -1-x2^post0+ret_incr3^post0 == 0 /\ a^post0-ret_incr3^post0 == 0 /\ -1+a^10 == 0), cost: 1 1: l2 -> l0 : a^0'=a^post1, x2^0'=x2^post1, ret_incr3^0'=ret_incr3^post1, (x2^0-x2^post1 == 0 /\ ret_incr3^0-ret_incr3^post1 == 0 /\ a^0-a^post1 == 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 Integer Transition Systems