details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.013484954834 seconds
cpu usage	0.009623206
max memory	786432.0

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: l2 0: l0 -> l1 : tmp^0'=tmp^post0, 0 == 0, cost: 1 1: l2 -> l0 : tmp^0'=tmp^post1, tmp^0-tmp^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