details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.26664996147 seconds
cpu usage	6.585365368
max memory	4.5006848E8

stage attributes

key	value
output-size	6350
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 523 ms] (2) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalspeedFails4start(A, B, C, D) -> Com_1(evalspeedFails4entryin(A, B, C, D)) :|: TRUE evalspeedFails4entryin(A, B, C, D) -> Com_1(evalspeedFails4bb6in(1, C, A, B)) :|: A >= 1 evalspeedFails4entryin(A, B, C, D) -> Com_1(evalspeedFails4bb6in(-(1), C, A, B)) :|: 0 >= A evalspeedFails4bb6in(A, B, C, D) -> Com_1(evalspeedFails4bb3in(A, B, C, D)) :|: B >= D evalspeedFails4bb6in(A, B, C, D) -> Com_1(evalspeedFails4returnin(A, B, C, D)) :|: D >= B + 1 evalspeedFails4bb3in(A, B, C, D) -> Com_1(evalspeedFails4bb4in(A, B, C, D)) :|: C >= 1 evalspeedFails4bb3in(A, B, C, D) -> Com_1(evalspeedFails4bb5in(A, B, C, D)) :|: 0 >= C evalspeedFails4bb4in(A, B, C, D) -> Com_1(evalspeedFails4bb6in(A, B, C, D + A)) :|: TRUE evalspeedFails4bb5in(A, B, C, D) -> Com_1(evalspeedFails4bb6in(A, B, C, D - A)) :|: TRUE evalspeedFails4returnin(A, B, C, D) -> Com_1(evalspeedFails4stop(A, B, C, D)) :|: TRUE The start-symbols are:[evalspeedFails4start_4] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalspeedFails4start 0: evalspeedFails4start -> evalspeedFails4entryin : [], cost: 1 1: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 1 2: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 1 3: evalspeedFails4bb6in -> evalspeedFails4bb3in : [ B>=D ], cost: 1 4: evalspeedFails4bb6in -> evalspeedFails4returnin : [ D>=1+B ], cost: 1 5: evalspeedFails4bb3in -> evalspeedFails4bb4in : [ C>=1 ], cost: 1 6: evalspeedFails4bb3in -> evalspeedFails4bb5in : [ 0>=C ], cost: 1 7: evalspeedFails4bb4in -> evalspeedFails4bb6in : D'=D+A, [], cost: 1 8: evalspeedFails4bb5in -> evalspeedFails4bb6in : D'=D-A, [], cost: 1 9: evalspeedFails4returnin -> evalspeedFails4stop : [], cost: 1 Removed unreachable and leaf rules: Start location: evalspeedFails4start 0: evalspeedFails4start -> evalspeedFails4entryin : [], cost: 1 1: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=1, B'=C, C'=A, D'=B, [ A>=1 ], cost: 1 2: evalspeedFails4entryin -> evalspeedFails4bb6in : A'=-1, B'=C, C'=A, D'=B, [ 0>=A ], cost: 1 3: evalspeedFails4bb6in -> evalspeedFails4bb3in : [ B>=D ], cost: 1 5: evalspeedFails4bb3in -> evalspeedFails4bb4in : [ C>=1 ], cost: 1 6: evalspeedFails4bb3in -> evalspeedFails4bb5in : [ 0>=C ], cost: 1 7: evalspeedFails4bb4in -> evalspeedFails4bb6in : D'=D+A, [], cost: 1 8: evalspeedFails4bb5in -> evalspeedFails4bb6in : D'=D-A, [], cost: 1 ### Simplification by acceleration and chaining ### Eliminated locations (on linear paths): popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843