details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.796022892 seconds
cpu usage	2.671501423
max memory	3.14515456E8

stage attributes

key	value
output-size	41056
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, 486 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_Loopus2011_ex3_start(v_.0, v_b, v_x) -> Com_1(eval_Loopus2011_ex3_bb0_in(v_.0, v_b, v_x)) :|: TRUE eval_Loopus2011_ex3_bb0_in(v_.0, v_b, v_x) -> Com_1(eval_Loopus2011_ex3_bb1_in(v_x, v_b, v_x)) :|: TRUE eval_Loopus2011_ex3_bb1_in(v_.0, v_b, v_x) -> Com_1(eval_Loopus2011_ex3_bb2_in(v_.0, v_b, v_x)) :|: 0 < v_.0 && v_.0 < 255 eval_Loopus2011_ex3_bb1_in(v_.0, v_b, v_x) -> Com_1(eval_Loopus2011_ex3_bb3_in(v_.0, v_b, v_x)) :|: 0 >= v_.0 eval_Loopus2011_ex3_bb1_in(v_.0, v_b, v_x) -> Com_1(eval_Loopus2011_ex3_bb3_in(v_.0, v_b, v_x)) :|: v_.0 >= 255 eval_Loopus2011_ex3_bb2_in(v_.0, v_b, v_x) -> Com_1(eval_Loopus2011_ex3_bb1_in(v_.0 + 1, v_b, v_x)) :|: v_b < 0 eval_Loopus2011_ex3_bb2_in(v_.0, v_b, v_x) -> Com_1(eval_Loopus2011_ex3_bb1_in(v_.0 + 1, v_b, v_x)) :|: v_b > 0 eval_Loopus2011_ex3_bb2_in(v_.0, v_b, v_x) -> Com_1(eval_Loopus2011_ex3_bb1_in(v_.0 - 1, v_b, v_x)) :|: v_b >= 0 && v_b <= 0 eval_Loopus2011_ex3_bb3_in(v_.0, v_b, v_x) -> Com_1(eval_Loopus2011_ex3_stop(v_.0, v_b, v_x)) :|: TRUE The start-symbols are:[eval_Loopus2011_ex3_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 4076*ar_1 + 16) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalLoopus2011ex3start(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb0in(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalLoopus2011ex3bb0in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb1in(ar_1, ar_1, ar_2)) (Comp: ?, Cost: 1) evalLoopus2011ex3bb1in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb2in(ar_0, ar_1, ar_2)) [ ar_0 >= 1 /\ 254 >= ar_0 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb1in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb1in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= 255 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb2in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb1in(ar_0 + 1, ar_1, ar_2)) [ 0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb2in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb1in(ar_0 + 1, ar_1, ar_2)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb2in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb1in(ar_0 - 1, ar_1, ar_2)) [ ar_2 = 0 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb3in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3start(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) evalLoopus2011ex3start(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb0in(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalLoopus2011ex3bb0in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb1in(ar_1, ar_1, ar_2)) (Comp: ?, Cost: 1) evalLoopus2011ex3bb1in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb2in(ar_0, ar_1, ar_2)) [ ar_0 >= 1 /\ 254 >= ar_0 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb1in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb1in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= 255 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb2in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb1in(ar_0 + 1, ar_1, ar_2)) [ 0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb2in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb1in(ar_0 + 1, ar_1, ar_2)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb2in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3bb1in(ar_0 - 1, ar_1, ar_2)) [ ar_2 = 0 ] (Comp: ?, Cost: 1) evalLoopus2011ex3bb3in(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3stop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalLoopus2011ex3start(ar_0, ar_1, ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445