details

property	value
status	complete
benchmark	Liveness6.3.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n041.star.cs.uiowa.edu
space	AProVE_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.217499017715 seconds
cpu usage	0.819366283
max memory	3.467264E7

stage attributes

key	value
output-size	5099
starexec-result	WORST_CASE(Omega(n^1),O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: check(no(x)) -> no(x) check(no(x)) -> no(check(x)) check(rec(x)) -> rec(check(x)) check(sent(x)) -> sent(check(x)) check(up(x)) -> up(check(x)) no(up(x)) -> up(no(x)) rec(bot()) -> up(sent(bot())) rec(no(x)) -> sent(rec(x)) rec(rec(x)) -> sent(rec(x)) rec(sent(x)) -> sent(rec(x)) rec(up(x)) -> up(rec(x)) sent(up(x)) -> up(sent(x)) top(no(up(x))) -> top(check(rec(x))) top(rec(up(x))) -> top(check(rec(x))) top(sent(up(x))) -> top(check(rec(x))) - Signature: {check/1,no/1,rec/1,sent/1,top/1} / {bot/0,up/1} - Obligation: runtime complexity wrt. defined symbols {check,no,rec,sent,top} and constructors {bot,up} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: check(no(x)) -> no(x) check(no(x)) -> no(check(x)) check(rec(x)) -> rec(check(x)) check(sent(x)) -> sent(check(x)) check(up(x)) -> up(check(x)) no(up(x)) -> up(no(x)) rec(bot()) -> up(sent(bot())) rec(no(x)) -> sent(rec(x)) rec(rec(x)) -> sent(rec(x)) rec(sent(x)) -> sent(rec(x)) rec(up(x)) -> up(rec(x)) sent(up(x)) -> up(sent(x)) top(no(up(x))) -> top(check(rec(x))) top(rec(up(x))) -> top(check(rec(x))) top(sent(up(x))) -> top(check(rec(x))) - Signature: {check/1,no/1,rec/1,sent/1,top/1} / {bot/0,up/1} - Obligation: runtime complexity wrt. defined symbols {check,no,rec,sent,top} and constructors {bot,up} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: check(x){x -> up(x)} = check(up(x)) ->^+ up(check(x)) = C[check(x) = check(x){}] ** Step 1.b:1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: check(no(x)) -> no(x) check(no(x)) -> no(check(x)) check(rec(x)) -> rec(check(x)) check(sent(x)) -> sent(check(x)) check(up(x)) -> up(check(x)) no(up(x)) -> up(no(x)) rec(bot()) -> up(sent(bot())) rec(no(x)) -> sent(rec(x)) rec(rec(x)) -> sent(rec(x)) rec(sent(x)) -> sent(rec(x)) rec(up(x)) -> up(rec(x)) sent(up(x)) -> up(sent(x)) top(no(up(x))) -> top(check(rec(x))) top(rec(up(x))) -> top(check(rec(x))) top(sent(up(x))) -> top(check(rec(x))) - Signature: {check/1,no/1,rec/1,sent/1,top/1} / {bot/0,up/1} - Obligation: runtime complexity wrt. defined symbols {check,no,rec,sent,top} and constructors {bot,up} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 1. The enriched problem is compatible with follwoing automaton. bot_0() -> 2 bot_1() -> 4 check_0(2) -> 1 check_1(2) -> 3 no_0(2) -> 1 no_1(2) -> 3 rec_0(2) -> 1 rec_1(2) -> 3 sent_0(2) -> 1 sent_1(2) -> 3 popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127