details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	3.08224582672 seconds
cpu usage	4.429700423
max memory	3.57462016E8

stage attributes

key	value
output-size	77500
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, 1887 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_Loopus2015_original_start(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_bb0_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len)) :|: TRUE eval_Loopus2015_original_bb0_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_bb1_in(v_1, v_2, v_4, 0, 0, v_end.1, 0, v_k.0, v_len)) :|: TRUE eval_Loopus2015_original_bb1_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_bb2_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len)) :|: v_i.0 < v_len eval_Loopus2015_original_bb1_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_bb5_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len)) :|: v_i.0 >= v_len eval_Loopus2015_original_bb2_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_1(v_i.0 + 1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len)) :|: TRUE eval_Loopus2015_original_1(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_2(eval_nondet_start(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len), eval_Loopus2015_original_2(v_1, nondef.0, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len)) :|: TRUE eval_Loopus2015_original_2(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_3(v_1, v_2, v_4, v_beg.0, v_end.0, v_1, v_i.0, v_k.0, v_len)) :|: v_2 > 0 eval_Loopus2015_original_2(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_3(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.0, v_i.0, v_k.0, v_len)) :|: v_2 <= 0 eval_Loopus2015_original_3(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_2(eval_nondet_start(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len), eval_Loopus2015_original_4(v_1, v_2, nondef.1, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len)) :|: TRUE eval_Loopus2015_original_4(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_bb3_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_beg.0, v_len)) :|: v_4 > 0 eval_Loopus2015_original_4(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_bb1_in(v_1, v_2, v_4, v_beg.0, v_end.1, v_end.1, v_1, v_k.0, v_len)) :|: v_4 <= 0 eval_Loopus2015_original_bb3_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_bb4_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len)) :|: v_k.0 < v_end.1 eval_Loopus2015_original_bb3_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_bb1_in(v_1, v_2, v_4, v_1, v_1, v_end.1, v_1, v_k.0, v_len)) :|: v_k.0 >= v_end.1 eval_Loopus2015_original_bb4_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_bb3_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0 + 1, v_len)) :|: TRUE eval_Loopus2015_original_bb5_in(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len) -> Com_1(eval_Loopus2015_original_stop(v_1, v_2, v_4, v_beg.0, v_end.0, v_end.1, v_i.0, v_k.0, v_len)) :|: TRUE The start-symbols are:[eval_Loopus2015_original_start_9] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 195*ar_3 + 141) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalLoopus2015originalstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) (Comp: ?, Cost: 1) evalLoopus2015originalbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalbb1in(0, 0, 0, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) (Comp: ?, Cost: 1) evalLoopus2015originalbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) [ ar_3 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalLoopus2015originalbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) [ ar_2 >= ar_3 ] (Comp: ?, Cost: 1) evalLoopus2015originalbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015original1(ar_0, ar_1, ar_2, ar_3, ar_2 + 1, ar_5, ar_6, ar_7, ar_8, ar_9)) (Comp: ?, Cost: 1) evalLoopus2015original10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) (Comp: ?, Cost: 1) evalLoopus2015original11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015original2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_6, ar_6, ar_7, ar_8, ar_9)) (Comp: ?, Cost: 1) evalLoopus2015original1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_2(evalLoopus2015original10(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, k, ar_7, ar_8, ar_9), evalLoopus2015original11(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, k, ar_7, ar_8, ar_9)) (Comp: ?, Cost: 1) evalLoopus2015original2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015original3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_4, ar_8, ar_9)) [ ar_5 >= 1 ] (Comp: ?, Cost: 1) evalLoopus2015original2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015original3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_1, ar_8, ar_9)) [ 0 >= ar_5 ] (Comp: ?, Cost: 1) evalLoopus2015original30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) (Comp: ?, Cost: 1) evalLoopus2015original31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015original4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_6, ar_9)) (Comp: ?, Cost: 1) evalLoopus2015original3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_2(evalLoopus2015original30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, k, ar_7, ar_8, ar_9), evalLoopus2015original31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, k, ar_7, ar_8, ar_9)) (Comp: ?, Cost: 1) evalLoopus2015original4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_0)) [ ar_8 >= 1 ] (Comp: ?, Cost: 1) evalLoopus2015original4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalbb1in(ar_0, ar_7, ar_4, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) [ 0 >= ar_8 ] (Comp: ?, Cost: 1) evalLoopus2015originalbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) [ ar_7 >= ar_9 + 1 ] (Comp: ?, Cost: 1) evalLoopus2015originalbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalbb1in(ar_4, ar_4, ar_4, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) [ ar_9 >= ar_7 ] (Comp: ?, Cost: 1) evalLoopus2015originalbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9 + 1)) (Comp: ?, Cost: 1) evalLoopus2015originalbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalstop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9) -> Com_1(evalLoopus2015originalstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445