details

property	value
status	complete
benchmark	speed_pldi09_fig4_4.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n040.star.cs.uiowa.edu
space	C4B_examples

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.35032606125 seconds
cpu usage	2.421207514
max memory	2.56933888E8

stage attributes

key	value
output-size	16130
starexec-result	WORST_CASE(?, O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox2/output/output_files/bench.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 174 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_peed_pldi09_fig4_4_start(v_i.0, v_m, v_n) -> Com_1(eval_peed_pldi09_fig4_4_bb0_in(v_i.0, v_m, v_n)) :|: TRUE eval_peed_pldi09_fig4_4_bb0_in(v_i.0, v_m, v_n) -> Com_1(eval_peed_pldi09_fig4_4_bb3_in(v_i.0, v_m, v_n)) :|: 0 >= v_m eval_peed_pldi09_fig4_4_bb0_in(v_i.0, v_m, v_n) -> Com_1(eval_peed_pldi09_fig4_4_bb1_in(v_n, v_m, v_n)) :|: 0 < v_m eval_peed_pldi09_fig4_4_bb1_in(v_i.0, v_m, v_n) -> Com_1(eval_peed_pldi09_fig4_4_bb2_in(v_i.0, v_m, v_n)) :|: v_i.0 > 0 eval_peed_pldi09_fig4_4_bb1_in(v_i.0, v_m, v_n) -> Com_1(eval_peed_pldi09_fig4_4_bb3_in(v_i.0, v_m, v_n)) :|: v_i.0 <= 0 eval_peed_pldi09_fig4_4_bb2_in(v_i.0, v_m, v_n) -> Com_1(eval_peed_pldi09_fig4_4_bb1_in(v_i.0 - 1, v_m, v_n)) :|: v_i.0 < v_m eval_peed_pldi09_fig4_4_bb2_in(v_i.0, v_m, v_n) -> Com_1(eval_peed_pldi09_fig4_4_bb1_in(v_i.0 - v_m, v_m, v_n)) :|: v_i.0 >= v_m eval_peed_pldi09_fig4_4_bb3_in(v_i.0, v_m, v_n) -> Com_1(eval_peed_pldi09_fig4_4_stop(v_i.0, v_m, v_n)) :|: TRUE The start-symbols are:[eval_peed_pldi09_fig4_4_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 6*ar_2 + 7) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalpeedpldi09fig44start(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb0in(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalpeedpldi09fig44bb0in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb0in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb1in(ar_0, ar_2, ar_2)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb1in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb2in(ar_0, ar_1, ar_2)) [ ar_1 >= 1 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb1in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_1 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb2in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb1in(ar_0, ar_1 - 1, ar_2)) [ ar_0 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb2in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb1in(ar_0, ar_1 - ar_0, ar_2)) [ ar_1 >= ar_0 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb3in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44start(ar_0, ar_1, ar_2)) [ 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) evalpeedpldi09fig44start(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb0in(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalpeedpldi09fig44bb0in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] (Comp: 1, Cost: 1) evalpeedpldi09fig44bb0in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb1in(ar_0, ar_2, ar_2)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb1in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb2in(ar_0, ar_1, ar_2)) [ ar_1 >= 1 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb1in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_1 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb2in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb1in(ar_0, ar_1 - 1, ar_2)) [ ar_0 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb2in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44bb1in(ar_0, ar_1 - ar_0, ar_2)) [ ar_1 >= ar_0 ] (Comp: ?, Cost: 1) evalpeedpldi09fig44bb3in(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalpeedpldi09fig44start(ar_0, ar_1, ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445