details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.46981 seconds
cpu usage	2.54834
user time	2.33654
system time	0.211796
max virtual memory	1.8449928E7
max residence set size	186084.0

stage attributes

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

output

2.45/1.44 WORST_CASE(?, O(n^1)) 2.45/1.45 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.45/1.45 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.45/1.45 2.45/1.45 2.45/1.45 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.45/1.45 2.45/1.45 (0) CpxIntTrs 2.45/1.45 (1) Koat Proof [FINISHED, 277 ms] 2.45/1.45 (2) BOUNDS(1, n^1) 2.45/1.45 2.45/1.45 2.45/1.45 ---------------------------------------- 2.45/1.45 2.45/1.45 (0) 2.45/1.45 Obligation: 2.45/1.45 Complexity Int TRS consisting of the following rules: 2.45/1.45 eval_speedpldi4_start(v_i.0, v_m, v_n) -> Com_1(eval_speedpldi4_bb0_in(v_i.0, v_m, v_n)) :|: TRUE 2.45/1.45 eval_speedpldi4_bb0_in(v_i.0, v_m, v_n) -> Com_1(eval_speedpldi4_bb3_in(v_i.0, v_m, v_n)) :|: v_m <= 0 2.45/1.45 eval_speedpldi4_bb0_in(v_i.0, v_m, v_n) -> Com_1(eval_speedpldi4_bb3_in(v_i.0, v_m, v_n)) :|: v_n <= v_m 2.45/1.45 eval_speedpldi4_bb0_in(v_i.0, v_m, v_n) -> Com_1(eval_speedpldi4_bb1_in(v_n, v_m, v_n)) :|: v_m > 0 && v_n > v_m 2.45/1.45 eval_speedpldi4_bb1_in(v_i.0, v_m, v_n) -> Com_1(eval_speedpldi4_bb2_in(v_i.0, v_m, v_n)) :|: v_i.0 > 0 2.45/1.45 eval_speedpldi4_bb1_in(v_i.0, v_m, v_n) -> Com_1(eval_speedpldi4_bb3_in(v_i.0, v_m, v_n)) :|: v_i.0 <= 0 2.45/1.45 eval_speedpldi4_bb2_in(v_i.0, v_m, v_n) -> Com_1(eval_speedpldi4_bb1_in(v_i.0 - 1, v_m, v_n)) :|: v_i.0 < v_m 2.45/1.45 eval_speedpldi4_bb2_in(v_i.0, v_m, v_n) -> Com_1(eval_speedpldi4_bb1_in(v_i.0 - v_m, v_m, v_n)) :|: v_i.0 >= v_m 2.45/1.45 eval_speedpldi4_bb3_in(v_i.0, v_m, v_n) -> Com_1(eval_speedpldi4_stop(v_i.0, v_m, v_n)) :|: TRUE 2.45/1.45 2.45/1.45 The start-symbols are:[eval_speedpldi4_start_3] 2.45/1.45 2.45/1.45 2.45/1.45 ---------------------------------------- 2.45/1.45 2.45/1.45 (1) Koat Proof (FINISHED) 2.45/1.45 YES(?, 6*ar_1 + 8) 2.45/1.45 2.45/1.45 2.45/1.45 2.45/1.45 Initial complexity problem: 2.45/1.45 2.45/1.45 1: T: 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb0in(ar_0, ar_1, ar_2)) 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb1in(ar_0, ar_1, ar_1)) [ ar_0 >= 1 /\ ar_1 >= ar_0 + 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb2in(ar_0, ar_1, ar_2)) [ ar_2 >= 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_2 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb1in(ar_0, ar_1, ar_2 - 1)) [ ar_0 >= ar_2 + 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb1in(ar_0, ar_1, ar_2 - ar_0)) [ ar_2 >= ar_0 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb3in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4stop(ar_0, ar_1, ar_2)) 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4start(ar_0, ar_1, ar_2)) [ 0 <= 0 ] 2.45/1.45 2.45/1.45 start location: koat_start 2.45/1.45 2.45/1.45 leaf cost: 0 2.45/1.45 2.45/1.45 2.45/1.45 2.45/1.45 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.45/1.45 2.45/1.45 2: T: 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 1) evalspeedpldi4start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb0in(ar_0, ar_1, ar_2)) 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 1) evalspeedpldi4bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 1) evalspeedpldi4bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_1 ] 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 1) evalspeedpldi4bb0in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb1in(ar_0, ar_1, ar_1)) [ ar_0 >= 1 /\ ar_1 >= ar_0 + 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb2in(ar_0, ar_1, ar_2)) [ ar_2 >= 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb1in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_2 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb1in(ar_0, ar_1, ar_2 - 1)) [ ar_0 >= ar_2 + 1 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb2in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4bb1in(ar_0, ar_1, ar_2 - ar_0)) [ ar_2 >= ar_0 ] 2.45/1.45 2.45/1.45 (Comp: ?, Cost: 1) evalspeedpldi4bb3in(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4stop(ar_0, ar_1, ar_2)) 2.45/1.45 2.45/1.45 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalspeedpldi4start(ar_0, ar_1, ar_2)) [ 0 <= 0 ] 2.45/1.45 2.45/1.45 start location: koat_start 2.45/1.45 2.45/1.45 leaf cost: 0 2.45/1.45 2.45/1.45 2.45/1.45 2.45/1.45 A polynomial rank function with 2.45/1.45 2.45/1.45 Pol(evalspeedpldi4start) = 2 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