details

property	value
status	complete
benchmark	while2.c.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n029.star.cs.uiowa.edu
space	Flores-Montoya_16

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.50180888176 seconds
cpu usage	5.309606541
max memory	2.8542976E8

stage attributes

key	value
output-size	42119
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, 112 ms] (2) BOUNDS(1, n^2) (3) Loat Proof [FINISHED, 711 ms] (4) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_while2_start(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_bb0_in(v_3, v_N, v_i_0, v_j_0)) :|: TRUE eval_while2_bb0_in(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_0(v_3, v_N, v_i_0, v_j_0)) :|: TRUE eval_while2_0(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_1(v_3, v_N, v_i_0, v_j_0)) :|: TRUE eval_while2_1(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_2(v_3, v_N, v_i_0, v_j_0)) :|: TRUE eval_while2_2(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_3(v_3, v_N, v_i_0, v_j_0)) :|: TRUE eval_while2_3(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_4(v_3, v_N, v_i_0, v_j_0)) :|: TRUE eval_while2_4(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_bb1_in(v_3, v_N, v_N, v_j_0)) :|: TRUE eval_while2_bb1_in(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_bb2_in(v_3, v_N, v_i_0, v_N)) :|: v_i_0 > 0 eval_while2_bb1_in(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_bb5_in(v_3, v_N, v_i_0, v_j_0)) :|: v_i_0 <= 0 eval_while2_bb2_in(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_bb3_in(v_3, v_N, v_i_0, v_j_0)) :|: v_j_0 > 0 eval_while2_bb2_in(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_bb4_in(v_3, v_N, v_i_0, v_j_0)) :|: v_j_0 <= 0 eval_while2_bb3_in(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_bb2_in(v_3, v_N, v_i_0, v_j_0 - 1)) :|: TRUE eval_while2_bb4_in(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_8(v_i_0 - 1, v_N, v_i_0, v_j_0)) :|: TRUE eval_while2_8(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_9(v_3, v_N, v_i_0, v_j_0)) :|: TRUE eval_while2_9(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_bb1_in(v_3, v_N, v_3, v_j_0)) :|: TRUE eval_while2_bb5_in(v_3, v_N, v_i_0, v_j_0) -> Com_1(eval_while2_stop(v_3, v_N, v_i_0, v_j_0)) :|: TRUE The start-symbols are:[eval_while2_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 19*ar_1 + 2*ar_1^2 + 28) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalwhile2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwhile2bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile20(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwhile20(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile21(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwhile21(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile22(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwhile22(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile23(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwhile23(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile24(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwhile24(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2bb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwhile2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2bb2in(ar_0, ar_1, ar_1, ar_3)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalwhile2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2bb5in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalwhile2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalwhile2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2bb4in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalwhile2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2bb2in(ar_0, ar_1, ar_2 - 1, ar_3)) (Comp: ?, Cost: 1) evalwhile2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile28(ar_0, ar_1, ar_2, ar_0 - 1)) (Comp: ?, Cost: 1) evalwhile28(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile29(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwhile29(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2bb1in(ar_3, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalwhile2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalwhile2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843