details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.66009092331 seconds
cpu usage	5.777852192
max memory	2.9159424E8

stage attributes

key	value
output-size	22215
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, 129 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 929 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_start_start(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_bb0_in(v__0, v__0_sink, v_1, v_3, v_n)) :|: TRUE eval_start_bb0_in(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_0(v__0, v__0_sink, v_1, v_3, v_n)) :|: TRUE eval_start_0(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_1(v__0, v__0_sink, v_1, v_3, v_n)) :|: TRUE eval_start_1(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_2(v__0, v__0_sink, v_1, v_3, v_n)) :|: TRUE eval_start_2(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_bb1_in(v_n, v__0_sink, v_1, v_3, v_n)) :|: TRUE eval_start_bb1_in(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_bb2_in(v__0, v__0, v_1, v_3, v_n)) :|: v__0 > 0 eval_start_bb1_in(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_bb4_in(v__0, v__0_sink, v_1, v_3, v_n)) :|: v__0 <= 0 eval_start_bb2_in(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_bb3_in(v__0, v__0_sink, v__0_sink - 1, v_3, v_n)) :|: v__0_sink - 1 > 0 eval_start_bb2_in(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_bb1_in(v__0_sink - 1, v__0_sink, v_1, v_3, v_n)) :|: v__0_sink - 1 <= 0 eval_start_bb3_in(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_5(v__0, v__0_sink, v_1, v_3, v_n)) :|: TRUE eval_start_5(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_6(v__0, v__0_sink, v_1, nondef_0, v_n)) :|: TRUE eval_start_6(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_bb1_in(v_1, v__0_sink, v_1, v_3, v_n)) :|: v_3 > 0 eval_start_6(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_bb2_in(v__0, v_1, v_1, v_3, v_n)) :|: v_3 <= 0 eval_start_bb4_in(v__0, v__0_sink, v_1, v_3, v_n) -> Com_1(eval_start_stop(v__0, v__0_sink, v_1, v_3, v_n)) :|: TRUE The start-symbols are:[eval_start_start_5] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 16*ar_1 + 9) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalstartstart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartbb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalstartbb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstart0(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalstart0(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstart1(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalstart1(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstart2(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalstart2(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartbb1in(ar_1, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalstartbb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartbb2in(ar_0, ar_1, ar_0, ar_3, ar_4)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalstartbb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartbb4in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalstartbb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartbb3in(ar_0, ar_1, ar_2, ar_2 - 1, ar_4)) [ ar_2 >= 2 ] (Comp: ?, Cost: 1) evalstartbb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartbb1in(ar_2 - 1, ar_1, ar_2, ar_3, ar_4)) [ 1 >= ar_2 ] (Comp: ?, Cost: 1) evalstartbb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstart5(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalstart5(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstart6(ar_0, ar_1, ar_2, ar_3, f)) (Comp: ?, Cost: 1) evalstart6(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartbb1in(ar_3, ar_1, ar_2, ar_3, ar_4)) [ ar_4 >= 1 ] (Comp: ?, Cost: 1) evalstart6(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartbb2in(ar_0, ar_1, ar_3, ar_3, ar_4)) [ 0 >= ar_4 ] (Comp: ?, Cost: 1) evalstartbb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartstop(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartstart(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 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) evalstartstart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstartbb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 1) evalstartbb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstart0(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: 1, Cost: 1) evalstart0(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalstart1(ar_0, ar_1, ar_2, ar_3, ar_4)) popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843