Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989586
details
property
value
status
complete
benchmark
cBench_render_ht.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n001.star.cs.uiowa.edu
space
Sinn_2016
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.71618 seconds
cpu usage
2.67109
user time
2.42972
system time
0.241377
max virtual memory
1.8273644E7
max residence set size
180136.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.10/1.68 WORST_CASE(?, O(n^1)) 2.10/1.69 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.10/1.69 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.10/1.69 2.10/1.69 2.10/1.69 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.10/1.69 2.10/1.69 (0) CpxIntTrs 2.10/1.69 (1) Koat Proof [FINISHED, 477 ms] 2.10/1.69 (2) BOUNDS(1, n^1) 2.10/1.69 2.10/1.69 2.10/1.69 ---------------------------------------- 2.10/1.69 2.10/1.69 (0) 2.10/1.69 Obligation: 2.10/1.69 Complexity Int TRS consisting of the following rules: 2.10/1.69 eval_render_ht_start(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb0_in(v_.0, v_0, v_level, v_old_level)) :|: TRUE 2.10/1.69 eval_render_ht_bb0_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb1_in(v_old_level, v_0, v_level, v_old_level)) :|: TRUE 2.10/1.69 eval_render_ht_bb1_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_LeafBlock_in(v_.0, v_level - v_.0, v_level, v_old_level)) :|: TRUE 2.10/1.69 eval_render_ht_LeafBlock_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb2_in(v_.0, v_0, v_level, v_old_level)) :|: v_0 + 7 <= 14 2.10/1.69 eval_render_ht_LeafBlock_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_NewDefault_in(v_.0, v_0, v_level, v_old_level)) :|: v_0 + 7 > 14 2.10/1.69 eval_render_ht_bb2_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_stop(v_.0, v_0, v_level, v_old_level)) :|: TRUE 2.10/1.69 eval_render_ht_NewDefault_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb3_in(v_.0, v_0, v_level, v_old_level)) :|: TRUE 2.10/1.69 eval_render_ht_bb3_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb1_in(v_.0 + 4, v_0, v_level, v_old_level)) :|: v_level > v_.0 2.10/1.69 eval_render_ht_bb3_in(v_.0, v_0, v_level, v_old_level) -> Com_1(eval_render_ht_bb1_in(v_.0 - 4, v_0, v_level, v_old_level)) :|: v_level <= v_.0 2.10/1.69 2.10/1.69 The start-symbols are:[eval_render_ht_start_4] 2.10/1.69 2.10/1.69 2.10/1.69 ---------------------------------------- 2.10/1.69 2.10/1.69 (1) Koat Proof (FINISHED) 2.10/1.69 YES(?, 6*ar_1 + 6*ar_3 + 11) 2.10/1.69 2.10/1.69 2.10/1.69 2.10/1.69 Initial complexity problem: 2.10/1.69 2.10/1.69 1: T: 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb0in(ar_0, ar_1, ar_2, ar_3)) 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_1, ar_1, ar_2, ar_3)) 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtLeafBlockin(ar_0, ar_1, ar_3 - ar_0, ar_3)) 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb2in(ar_0, ar_1, ar_2, ar_3)) [ 7 >= ar_2 ] 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtNewDefaultin(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 8 ] 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtstop(ar_0, ar_1, ar_2, ar_3)) 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtNewDefaultin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3)) 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_0 + 4, ar_1, ar_2, ar_3)) [ ar_3 >= ar_0 + 1 ] 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_0 - 4, ar_1, ar_2, ar_3)) [ ar_0 >= ar_3 ] 2.10/1.69 2.10/1.69 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtstart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.10/1.69 2.10/1.69 start location: koat_start 2.10/1.69 2.10/1.69 leaf cost: 0 2.10/1.69 2.10/1.69 2.10/1.69 2.10/1.69 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.10/1.69 2.10/1.69 2: T: 2.10/1.69 2.10/1.69 (Comp: 1, Cost: 1) evalrenderhtstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb0in(ar_0, ar_1, ar_2, ar_3)) 2.10/1.69 2.10/1.69 (Comp: 1, Cost: 1) evalrenderhtbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_1, ar_1, ar_2, ar_3)) 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtLeafBlockin(ar_0, ar_1, ar_3 - ar_0, ar_3)) 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb2in(ar_0, ar_1, ar_2, ar_3)) [ 7 >= ar_2 ] 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtLeafBlockin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtNewDefaultin(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 8 ] 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtstop(ar_0, ar_1, ar_2, ar_3)) 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtNewDefaultin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3)) 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_0 + 4, ar_1, ar_2, ar_3)) [ ar_3 >= ar_0 + 1 ] 2.10/1.69 2.10/1.69 (Comp: ?, Cost: 1) evalrenderhtbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtbb1in(ar_0 - 4, ar_1, ar_2, ar_3)) [ ar_0 >= ar_3 ] 2.10/1.69 2.10/1.69 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrenderhtstart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.10/1.69 2.10/1.69 start location: koat_start 2.10/1.69 2.10/1.69 leaf cost: 0 2.10/1.69 2.10/1.69 2.10/1.69 2.10/1.69 A polynomial rank function with 2.10/1.69 2.10/1.69 Pol(evalrenderhtstart) = 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