details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.93508005142 seconds
cpu usage	3.053549107
max memory	3.04869376E8

stage attributes

key	value
output-size	37291
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, 792 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_Loopus2011_ex1_start(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb0_in(v_3, v_i.0, v_i.1, v_j.0, v_n)) :|: TRUE eval_Loopus2011_ex1_bb0_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb1_in(v_3, 0, v_i.1, v_j.0, v_n)) :|: TRUE eval_Loopus2011_ex1_bb1_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb2_in(v_3, v_i.0, v_i.1, v_j.0, v_n)) :|: v_i.0 < v_n eval_Loopus2011_ex1_bb1_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb6_in(v_3, v_i.0, v_i.1, v_j.0, v_n)) :|: v_i.0 >= v_n eval_Loopus2011_ex1_bb2_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb3_in(v_3, v_i.0, v_i.0 + 1, 0, v_n)) :|: TRUE eval_Loopus2011_ex1_bb3_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb4_in(v_3, v_i.0, v_i.1, v_j.0, v_n)) :|: v_i.1 < v_n eval_Loopus2011_ex1_bb3_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_.critedge_in(v_3, v_i.0, v_i.1, v_j.0, v_n)) :|: v_i.1 >= v_n eval_Loopus2011_ex1_bb4_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_2(v_3, v_i.0, v_i.1, v_j.0, v_n)) :|: TRUE eval_Loopus2011_ex1_2(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_2(eval_nondet_start(v_3, v_i.0, v_i.1, v_j.0, v_n), eval_Loopus2011_ex1_3(nondef.0, v_i.0, v_i.1, v_j.0, v_n)) :|: TRUE eval_Loopus2011_ex1_3(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb5_in(v_3, v_i.0, v_i.1, v_j.0, v_n)) :|: v_3 > 0 eval_Loopus2011_ex1_3(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_.critedge_in(v_3, v_i.0, v_i.1, v_j.0, v_n)) :|: v_3 <= 0 eval_Loopus2011_ex1_bb5_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb3_in(v_3, v_i.0, v_i.1 + 1, v_j.0 + 1, v_n)) :|: TRUE eval_Loopus2011_ex1_.critedge_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb1_in(v_3, v_i.1 - 1, v_i.1, v_j.0, v_n)) :|: v_j.0 > 0 eval_Loopus2011_ex1_.critedge_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_bb1_in(v_3, v_i.1, v_i.1, v_j.0, v_n)) :|: v_j.0 <= 0 eval_Loopus2011_ex1_bb6_in(v_3, v_i.0, v_i.1, v_j.0, v_n) -> Com_1(eval_Loopus2011_ex1_stop(v_3, v_i.0, v_i.1, v_j.0, v_n)) :|: TRUE The start-symbols are:[eval_Loopus2011_ex1_start_5] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 208*ar_1 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalLoopus2011ex1start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalLoopus2011ex1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb1in(0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalLoopus2011ex1bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalLoopus2011ex1bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalLoopus2011ex1bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb3in(ar_0, ar_1, ar_0 + 1, 0, ar_4, ar_5)) (Comp: ?, Cost: 1) evalLoopus2011ex1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalLoopus2011ex1bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_2 >= ar_1 ] (Comp: ?, Cost: 1) evalLoopus2011ex1bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalLoopus2011ex120(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) evalLoopus2011ex121(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex13(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5)) (Comp: ?, Cost: 1) evalLoopus2011ex12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalLoopus2011ex120(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalLoopus2011ex121(ar_0, ar_1, ar_2, ar_3, ar_4, g)) (Comp: ?, Cost: 1) evalLoopus2011ex13(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_4 >= 1 ] (Comp: ?, Cost: 1) evalLoopus2011ex13(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_4 ] (Comp: ?, Cost: 1) evalLoopus2011ex1bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb3in(ar_0, ar_1, ar_2 + 1, ar_3 + 1, ar_4, ar_5)) (Comp: ?, Cost: 1) evalLoopus2011ex1critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb1in(ar_2 - 1, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_3 >= 1 ] (Comp: ?, Cost: 1) evalLoopus2011ex1critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb1in(ar_2, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_3 ] (Comp: ?, Cost: 1) evalLoopus2011ex1bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 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) evalLoopus2011ex1start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalLoopus2011ex1bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445