details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.84488511086 seconds
cpu usage	6.330482262
max memory	3.124224E8

stage attributes

key	value
output-size	64668
starexec-result	WORST_CASE(Omega(n^2), O(n^2))

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^2), O(n^2)) 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^2, n^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 449 ms] (2) BOUNDS(1, n^2) (3) Loat Proof [FINISHED, 1072 ms] (4) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalEx1start(A, B, C, D) -> Com_1(evalEx1entryin(A, B, C, D)) :|: TRUE evalEx1entryin(A, B, C, D) -> Com_1(evalEx1bb6in(0, A, C, D)) :|: TRUE evalEx1bb6in(A, B, C, D) -> Com_1(evalEx1bbin(A, B, C, D)) :|: B >= A + 1 evalEx1bb6in(A, B, C, D) -> Com_1(evalEx1returnin(A, B, C, D)) :|: A >= B evalEx1bbin(A, B, C, D) -> Com_1(evalEx1bb4in(A, B, A + 1, B)) :|: TRUE evalEx1bb4in(A, B, C, D) -> Com_1(evalEx1bb1in(A, B, C, D)) :|: D >= C + 1 evalEx1bb4in(A, B, C, D) -> Com_1(evalEx1bb5in(A, B, C, D)) :|: C >= D evalEx1bb1in(A, B, C, D) -> Com_1(evalEx1bb4in(A, B, C, D - 1)) :|: 0 >= E + 1 evalEx1bb1in(A, B, C, D) -> Com_1(evalEx1bb4in(A, B, C, D - 1)) :|: 0 >= E + 1 && E >= 1 evalEx1bb1in(A, B, C, D) -> Com_1(evalEx1bb4in(A, B, C, D - 1)) :|: E >= 1 evalEx1bb1in(A, B, C, D) -> Com_1(evalEx1bb4in(A, B, C, D)) :|: 0 >= 1 evalEx1bb1in(A, B, C, D) -> Com_1(evalEx1bb4in(A, B, C + 1, D - 1)) :|: 0 >= 1 evalEx1bb1in(A, B, C, D) -> Com_1(evalEx1bb4in(A, B, C + 1, D)) :|: TRUE evalEx1bb5in(A, B, C, D) -> Com_1(evalEx1bb6in(A + 1, D, C, D)) :|: TRUE evalEx1returnin(A, B, C, D) -> Com_1(evalEx1stop(A, B, C, D)) :|: TRUE The start-symbols are:[evalEx1start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 22*ar_0 + 24*ar_0^2 + 14) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalEx1start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1entryin(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalEx1entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb6in(0, ar_0, ar_2, ar_3)) (Comp: ?, Cost: 1) evalEx1bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalEx1bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalEx1bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_0 + 1, ar_1)) (Comp: ?, Cost: 1) evalEx1bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalEx1bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_3 ] (Comp: ?, Cost: 1) evalEx1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_2, ar_3 - 1)) [ 0 >= e + 1 ] (Comp: ?, Cost: 1) evalEx1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_2, ar_3 - 1)) [ 0 >= e + 1 /\ e >= 1 ] (Comp: ?, Cost: 1) evalEx1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_2, ar_3 - 1)) [ e >= 1 ] (Comp: ?, Cost: 1) evalEx1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= 1 ] (Comp: ?, Cost: 1) evalEx1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_2 + 1, ar_3 - 1)) [ 0 >= 1 ] (Comp: ?, Cost: 1) evalEx1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_2 + 1, ar_3)) (Comp: ?, Cost: 1) evalEx1bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb6in(ar_0 + 1, ar_3, ar_2, ar_3)) (Comp: ?, Cost: 1) evalEx1returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 1: evalEx1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_2, ar_3 - 1)) [ 0 >= e + 1 /\ e >= 1 ] evalEx1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= 1 ] evalEx1bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalEx1bb4in(ar_0, ar_1, ar_2 + 1, ar_3 - 1)) [ 0 >= 1 ] popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843