details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.32467603683 seconds
cpu usage	5.719568449
max memory	3.57654528E8

stage attributes

key	value
output-size	11149
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(INF, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 618 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalEx5start(A, B, C, D, E) -> Com_1(evalEx5entryin(A, B, C, D, E)) :|: TRUE evalEx5entryin(A, B, C, D, E) -> Com_1(evalEx5bb6in(0, A, C, D, E)) :|: TRUE evalEx5bb6in(A, B, C, D, E) -> Com_1(evalEx5bb3in(A, B, 0, B, E)) :|: B >= A + 1 evalEx5bb6in(A, B, C, D, E) -> Com_1(evalEx5returnin(A, B, C, D, E)) :|: A >= B evalEx5bb3in(A, B, C, D, E) -> Com_1(evalEx5bb1in(A, B, C, D, E)) :|: 0 >= F + 1 evalEx5bb3in(A, B, C, D, E) -> Com_1(evalEx5bb1in(A, B, C, D, E)) :|: F >= 1 evalEx5bb3in(A, B, C, D, E) -> Com_1(evalEx5bb4in(A, B, C, D, E)) :|: TRUE evalEx5bb1in(A, B, C, D, E) -> Com_1(evalEx5bb2in(A, B, C, D, D - 1)) :|: 0 >= F + 1 evalEx5bb1in(A, B, C, D, E) -> Com_1(evalEx5bb2in(A, B, C, D, D - 1)) :|: 0 >= F + 1 && F >= 1 evalEx5bb1in(A, B, C, D, E) -> Com_1(evalEx5bb2in(A, B, C, D, D - 1)) :|: F >= 1 evalEx5bb1in(A, B, C, D, E) -> Com_1(evalEx5bb3in(A, B, C, D - 1, E)) :|: 0 >= 1 evalEx5bb1in(A, B, C, D, E) -> Com_1(evalEx5bb2in(A, B, C, D, D)) :|: 0 >= 1 evalEx5bb1in(A, B, C, D, E) -> Com_1(evalEx5bb3in(A, B, C, D, E)) :|: TRUE evalEx5bb2in(A, B, C, D, E) -> Com_1(evalEx5bb3in(A, B, 1, E, E)) :|: TRUE evalEx5bb4in(A, B, C, D, E) -> Com_1(evalEx5bb6in(A + 1, D, C, D, E)) :|: C >= 0 && C <= 0 evalEx5bb4in(A, B, C, D, E) -> Com_1(evalEx5bb6in(A, D, C, D, E)) :|: 0 >= C + 1 evalEx5bb4in(A, B, C, D, E) -> Com_1(evalEx5bb6in(A, D, C, D, E)) :|: C >= 1 evalEx5returnin(A, B, C, D, E) -> Com_1(evalEx5stop(A, B, C, D, E)) :|: TRUE The start-symbols are:[evalEx5start_5] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalEx5start 0: evalEx5start -> evalEx5entryin : [], cost: 1 1: evalEx5entryin -> evalEx5bb6in : A'=0, B'=A, [], cost: 1 2: evalEx5bb6in -> evalEx5bb3in : C'=0, D'=B, [ B>=1+A ], cost: 1 3: evalEx5bb6in -> evalEx5returnin : [ A>=B ], cost: 1 4: evalEx5bb3in -> evalEx5bb1in : [ 0>=1+free ], cost: 1 5: evalEx5bb3in -> evalEx5bb1in : [ free_1>=1 ], cost: 1 6: evalEx5bb3in -> evalEx5bb4in : [], cost: 1 7: evalEx5bb1in -> evalEx5bb2in : E'=-1+D, [ 0>=1+free_2 ], cost: 1 8: evalEx5bb1in -> evalEx5bb2in : E'=-1+D, [ 0>=1+free_3 && free_3>=1 ], cost: 1 9: evalEx5bb1in -> evalEx5bb2in : E'=-1+D, [ free_4>=1 ], cost: 1 10: evalEx5bb1in -> evalEx5bb3in : D'=-1+D, [ 0>=1 ], cost: 1 11: evalEx5bb1in -> evalEx5bb2in : E'=D, [ 0>=1 ], cost: 1 12: evalEx5bb1in -> evalEx5bb3in : [], cost: 1 13: evalEx5bb2in -> evalEx5bb3in : C'=1, D'=E, [], cost: 1 14: evalEx5bb4in -> evalEx5bb6in : A'=1+A, B'=D, [ C==0 ], cost: 1 15: evalEx5bb4in -> evalEx5bb6in : B'=D, [ 0>=1+C ], cost: 1 16: evalEx5bb4in -> evalEx5bb6in : B'=D, [ C>=1 ], cost: 1 17: evalEx5returnin -> evalEx5stop : [], cost: 1 Removed unreachable and leaf rules: Start location: evalEx5start popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843