details

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

run statistics

property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	0.00965306 seconds
cpu usage	0.007891
user time	0.00435
system time	0.003541
max virtual memory	0.0
max residence set size	3088.0

stage attributes

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

output

WORST_CASE(Omega(0),?) Initial ITS Start location: l2 0: l0 -> l1 : Result_4^0'=Result_4^post0, loop_count_14^0'=loop_count_14^post0, request_8^0'=request_8^post0, devExt_7^0'=devExt_7^post0, lt_48^0'=lt_48^post0, irp_11^0'=irp_11^post0, nPackets_10^0'=nPackets_10^post0, cnt_60^0'=cnt_60^post0, loop_max_13^0'=loop_max_13^post0, i_12^0'=i_12^post0, nPacketsOld_9^0'=nPacketsOld_9^post0, (0 == 0 /\ -cnt_60^0+lt_48^post0 == 0 /\ -cnt_60^post0+cnt_60^0 == 0), cost: 1 1: l2 -> l0 : Result_4^0'=Result_4^post1, loop_count_14^0'=loop_count_14^post1, request_8^0'=request_8^post1, devExt_7^0'=devExt_7^post1, lt_48^0'=lt_48^post1, irp_11^0'=irp_11^post1, nPackets_10^0'=nPackets_10^post1, cnt_60^0'=cnt_60^post1, loop_max_13^0'=loop_max_13^post1, i_12^0'=i_12^post1, nPacketsOld_9^0'=nPacketsOld_9^post1, (-nPacketsOld_9^post1+nPacketsOld_9^0 == 0 /\ nPackets_10^0-nPackets_10^post1 == 0 /\ -loop_max_13^post1+loop_max_13^0 == 0 /\ -devExt_7^post1+devExt_7^0 == 0 /\ -cnt_60^post1+cnt_60^0 == 0 /\ Result_4^0-Result_4^post1 == 0 /\ irp_11^0-irp_11^post1 == 0 /\ -lt_48^post1+lt_48^0 == 0 /\ loop_count_14^0-loop_count_14^post1 == 0 /\ -i_12^post1+i_12^0 == 0 /\ request_8^0-request_8^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 ITS