details

property	value
status	timeout (wallclock)
benchmark	filliatre2.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	CiME_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	294.307022095 seconds
cpu usage	1190.0026395
max memory	6.79374848E9

stage attributes

unavailable

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: f(t,x) -> f'(t,g(x)) f'(triple(a,b,c),A()) -> f''(foldB(triple(s(a),0(),c),b)) f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) f'(triple(a,b,c),C()) -> triple(a,b,s(c)) f''(triple(a,b,c)) -> foldC(triple(a,b,0()),c) foldB(t,0()) -> t foldB(t,s(n)) -> f(foldB(t,n),B()) foldC(t,0()) -> t foldC(t,s(n)) -> f(foldC(t,n),C()) g(A()) -> A() g(B()) -> A() g(B()) -> B() g(C()) -> A() g(C()) -> B() g(C()) -> C() - Signature: {f/2,f'/2,f''/1,foldB/2,foldC/2,g/1} / {0/0,A/0,B/0,C/0,s/1,triple/3} - Obligation: innermost runtime complexity wrt. defined symbols {f,f',f'',foldB,foldC,g} and constructors {0,A,B,C,s ,triple} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: f(t,x) -> f'(t,g(x)) f'(triple(a,b,c),A()) -> f''(foldB(triple(s(a),0(),c),b)) f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) f'(triple(a,b,c),C()) -> triple(a,b,s(c)) f''(triple(a,b,c)) -> foldC(triple(a,b,0()),c) foldB(t,0()) -> t foldB(t,s(n)) -> f(foldB(t,n),B()) foldC(t,0()) -> t foldC(t,s(n)) -> f(foldC(t,n),C()) g(A()) -> A() g(B()) -> A() g(B()) -> B() g(C()) -> A() g(C()) -> B() g(C()) -> C() - Signature: {f/2,f'/2,f''/1,foldB/2,foldC/2,g/1} / {0/0,A/0,B/0,C/0,s/1,triple/3} - Obligation: innermost runtime complexity wrt. defined symbols {f,f',f'',foldB,foldC,g} and constructors {0,A,B,C,s ,triple} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: foldB(x,y){y -> s(y)} = foldB(x,s(y)) ->^+ f(foldB(x,y),B()) = C[foldB(x,y) = foldB(x,y){}] WORST_CASE(Omega(n^1),?) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807