details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.67502 seconds
cpu usage	2.69989
user time	2.47914
system time	0.220751
max virtual memory	1.8273644E7
max residence set size	182612.0

stage attributes

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

output

2.17/1.64 WORST_CASE(?, O(n^1)) 2.17/1.65 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.17/1.65 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.17/1.65 2.17/1.65 2.17/1.65 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.17/1.65 2.17/1.65 (0) CpxIntTrs 2.17/1.65 (1) Koat Proof [FINISHED, 481 ms] 2.17/1.65 (2) BOUNDS(1, n^1) 2.17/1.65 2.17/1.65 2.17/1.65 ---------------------------------------- 2.17/1.65 2.17/1.65 (0) 2.17/1.65 Obligation: 2.17/1.65 Complexity Int TRS consisting of the following rules: 2.17/1.65 eval_speed_popl10_sequential_single_start(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb0_in(v_1, v_n, v_x.0, v_x.1)) :|: TRUE 2.17/1.65 eval_speed_popl10_sequential_single_bb0_in(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb1_in(v_1, v_n, 0, v_x.1)) :|: TRUE 2.17/1.65 eval_speed_popl10_sequential_single_bb1_in(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb2_in(v_1, v_n, v_x.0, v_x.1)) :|: v_x.0 < v_n 2.17/1.65 eval_speed_popl10_sequential_single_bb1_in(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb4_in(v_1, v_n, v_x.0, v_x.0)) :|: v_x.0 >= v_n 2.17/1.65 eval_speed_popl10_sequential_single_bb2_in(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_0(v_1, v_n, v_x.0, v_x.1)) :|: TRUE 2.17/1.65 eval_speed_popl10_sequential_single_0(v_1, v_n, v_x.0, v_x.1) -> Com_2(eval_nondet_start(v_1, v_n, v_x.0, v_x.1), eval_speed_popl10_sequential_single_1(nondef.0, v_n, v_x.0, v_x.1)) :|: TRUE 2.17/1.65 eval_speed_popl10_sequential_single_1(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb4_in(v_1, v_n, v_x.0, v_x.0)) :|: v_1 > 0 2.17/1.65 eval_speed_popl10_sequential_single_1(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb3_in(v_1, v_n, v_x.0, v_x.1)) :|: v_1 <= 0 2.17/1.65 eval_speed_popl10_sequential_single_bb3_in(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb1_in(v_1, v_n, v_x.0 + 1, v_x.1)) :|: TRUE 2.17/1.65 eval_speed_popl10_sequential_single_bb4_in(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb5_in(v_1, v_n, v_x.0, v_x.1)) :|: v_x.1 < v_n 2.17/1.65 eval_speed_popl10_sequential_single_bb4_in(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb6_in(v_1, v_n, v_x.0, v_x.1)) :|: v_x.1 >= v_n 2.17/1.65 eval_speed_popl10_sequential_single_bb5_in(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_bb4_in(v_1, v_n, v_x.0, v_x.1 + 1)) :|: TRUE 2.17/1.65 eval_speed_popl10_sequential_single_bb6_in(v_1, v_n, v_x.0, v_x.1) -> Com_1(eval_speed_popl10_sequential_single_stop(v_1, v_n, v_x.0, v_x.1)) :|: TRUE 2.17/1.65 2.17/1.65 The start-symbols are:[eval_speed_popl10_sequential_single_start_4] 2.17/1.65 2.17/1.65 2.17/1.65 ---------------------------------------- 2.17/1.65 2.17/1.65 (1) Koat Proof (FINISHED) 2.17/1.65 YES(?, 63*ar_1 + 14) 2.17/1.65 2.17/1.65 2.17/1.65 2.17/1.65 Initial complexity problem: 2.17/1.65 2.17/1.65 1: T: 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglestart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb1in(0, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_1 >= ar_0 + 1 ] 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb4in(ar_0, ar_1, ar_0, ar_3, ar_4)) [ ar_0 >= ar_1 ] 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsingle0(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsingle00(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsingle01(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsingle1(ar_0, ar_1, ar_2, ar_4, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsingle0(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_2(evalspeedpopl10sequentialsingle00(ar_0, ar_1, ar_2, ar_3, f), evalspeedpopl10sequentialsingle01(ar_0, ar_1, ar_2, ar_3, f)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsingle1(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb4in(ar_0, ar_1, ar_0, ar_3, ar_4)) [ ar_3 >= 1 ] 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsingle1(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 ] 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb1in(ar_0 + 1, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb5in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_1 >= ar_2 + 1 ] 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb4in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb6in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_2 >= ar_1 ] 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb5in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb4in(ar_0, ar_1, ar_2 + 1, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb6in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglestop(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglestart(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ] 2.17/1.65 2.17/1.65 start location: koat_start 2.17/1.65 2.17/1.65 leaf cost: 0 2.17/1.65 2.17/1.65 2.17/1.65 2.17/1.65 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.17/1.65 2.17/1.65 2: T: 2.17/1.65 2.17/1.65 (Comp: 1, Cost: 1) evalspeedpopl10sequentialsinglestart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: 1, Cost: 1) evalspeedpopl10sequentialsinglebb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb1in(0, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_1 >= ar_0 + 1 ] 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsinglebb4in(ar_0, ar_1, ar_0, ar_3, ar_4)) [ ar_0 >= ar_1 ] 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsinglebb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsingle0(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsingle00(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4)) 2.17/1.65 2.17/1.65 (Comp: ?, Cost: 1) evalspeedpopl10sequentialsingle01(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalspeedpopl10sequentialsingle1(ar_0, ar_1, ar_2, ar_4, ar_4)) popout

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

job log

popout

actions

all output return to Complexity_C_Integer 2019-03-21 04.38