details

property	value
status	complete
benchmark	ex01.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n009.star.cs.uiowa.edu
space	ABC

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.85170316696 seconds
cpu usage	4.080804698
max memory	2.28970496E8

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 17 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 233 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalfstart(A, B) -> Com_1(evalfentryin(A, B)) :|: TRUE evalfentryin(A, B) -> Com_1(evalfbb1in(B, A)) :|: TRUE evalfbb1in(A, B) -> Com_1(evalfbbin(A, B)) :|: A >= B evalfbb1in(A, B) -> Com_1(evalfreturnin(A, B)) :|: B >= A + 1 evalfbbin(A, B) -> Com_1(evalfbb1in(A, B + 1)) :|: TRUE evalfreturnin(A, B) -> Com_1(evalfstop(A, B)) :|: TRUE The start-symbols are:[evalfstart_2] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*ar_0 + 2*ar_1 + 8) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalfstart(ar_0, ar_1) -> Com_1(evalfentryin(ar_0, ar_1)) (Comp: ?, Cost: 1) evalfentryin(ar_0, ar_1) -> Com_1(evalfbb1in(ar_1, ar_0)) (Comp: ?, Cost: 1) evalfbb1in(ar_0, ar_1) -> Com_1(evalfbbin(ar_0, ar_1)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalfbb1in(ar_0, ar_1) -> Com_1(evalfreturnin(ar_0, ar_1)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalfbbin(ar_0, ar_1) -> Com_1(evalfbb1in(ar_0, ar_1 + 1)) (Comp: ?, Cost: 1) evalfreturnin(ar_0, ar_1) -> Com_1(evalfstop(ar_0, ar_1)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evalfstart(ar_0, ar_1)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) evalfstart(ar_0, ar_1) -> Com_1(evalfentryin(ar_0, ar_1)) (Comp: 1, Cost: 1) evalfentryin(ar_0, ar_1) -> Com_1(evalfbb1in(ar_1, ar_0)) (Comp: ?, Cost: 1) evalfbb1in(ar_0, ar_1) -> Com_1(evalfbbin(ar_0, ar_1)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalfbb1in(ar_0, ar_1) -> Com_1(evalfreturnin(ar_0, ar_1)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalfbbin(ar_0, ar_1) -> Com_1(evalfbb1in(ar_0, ar_1 + 1)) (Comp: ?, Cost: 1) evalfreturnin(ar_0, ar_1) -> Com_1(evalfstop(ar_0, ar_1)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evalfstart(ar_0, ar_1)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evalfstart) = 2 Pol(evalfentryin) = 2 Pol(evalfbb1in) = 2 Pol(evalfbbin) = 2 popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843