Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989615
details
property
value
status
complete
benchmark
heapsort.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n016.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.469035 seconds
cpu usage
0.398551
user time
0.366871
system time
0.03168
max virtual memory
113176.0
max residence set size
11896.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(n^1))
output
0.06/0.36 WORST_CASE(?,O(n^1)) 0.06/0.36 0.06/0.36 Preprocessing Cost Relations 0.06/0.36 ===================================== 0.06/0.36 0.06/0.36 #### Computed strongly connected components 0.06/0.36 0. recursive : [eval_heapsort_4/5,eval_heapsort_5/6,eval_heapsort_7/6,eval_heapsort_8/7,eval_heapsort_bb10_in/7,eval_heapsort_bb1_in/3,eval_heapsort_bb2_in/3,eval_heapsort_bb3_in/5,eval_heapsort_bb4_in/5,eval_heapsort_bb5_in/6,eval_heapsort_bb6_in/6,eval_heapsort_bb7_in/6,eval_heapsort_bb8_in/7,eval_heapsort_bb9_in/7] 0.06/0.36 1. non_recursive : [eval_heapsort_stop/1] 0.06/0.36 2. non_recursive : [eval_heapsort_bb11_in/1] 0.06/0.36 3. non_recursive : [eval_heapsort_bb1_in_loop_cont/2] 0.06/0.36 4. non_recursive : [eval_heapsort_bb0_in/2] 0.06/0.36 5. non_recursive : [eval_heapsort_start/2] 0.06/0.36 0.06/0.36 #### Obtained direct recursion through partial evaluation 0.06/0.36 0. SCC is partially evaluated into eval_heapsort_bb1_in/3 0.06/0.36 1. SCC is completely evaluated into other SCCs 0.06/0.36 2. SCC is completely evaluated into other SCCs 0.06/0.36 3. SCC is completely evaluated into other SCCs 0.06/0.36 4. SCC is partially evaluated into eval_heapsort_bb0_in/2 0.06/0.36 5. SCC is partially evaluated into eval_heapsort_start/2 0.06/0.36 0.06/0.36 Control-Flow Refinement of Cost Relations 0.06/0.36 ===================================== 0.06/0.36 0.06/0.36 ### Specialization of cost equations eval_heapsort_bb1_in/3 0.06/0.36 * CE 7 is refined into CE [11] 0.06/0.36 * CE 3 is refined into CE [12] 0.06/0.36 * CE 10 is discarded (unfeasible) 0.06/0.36 * CE 9 is refined into CE [13] 0.06/0.36 * CE 5 is refined into CE [14] 0.06/0.36 * CE 6 is refined into CE [15] 0.06/0.36 * CE 8 is refined into CE [16] 0.06/0.36 * CE 4 is refined into CE [17] 0.06/0.36 0.06/0.36 0.06/0.36 ### Cost equations --> "Loop" of eval_heapsort_bb1_in/3 0.06/0.36 * CEs [15] --> Loop 11 0.06/0.36 * CEs [16] --> Loop 12 0.06/0.36 * CEs [17] --> Loop 13 0.06/0.36 * CEs [11] --> Loop 14 0.06/0.36 * CEs [12] --> Loop 15 0.06/0.36 * CEs [14] --> Loop 16 0.06/0.36 * CEs [13] --> Loop 17 0.06/0.36 0.06/0.36 ### Ranking functions of CR eval_heapsort_bb1_in(V_size,V_i_0,B) 0.06/0.36 * RF of phase [11,12]: [V_size/2-V_i_0] 0.06/0.36 0.06/0.36 #### Partial ranking functions of CR eval_heapsort_bb1_in(V_size,V_i_0,B) 0.06/0.36 * Partial RF of phase [11,12]: 0.06/0.36 - RF of loop [11:1]: 0.06/0.36 V_size/4-V_i_0/2 0.06/0.36 - RF of loop [12:1]: 0.06/0.36 V_size/2-V_i_0 0.06/0.36 0.06/0.36 0.06/0.36 ### Specialization of cost equations eval_heapsort_bb0_in/2 0.06/0.36 * CE 2 is refined into CE [18,19,20,21,22,23,24] 0.06/0.36 0.06/0.36 0.06/0.36 ### Cost equations --> "Loop" of eval_heapsort_bb0_in/2 0.06/0.36 * CEs [23] --> Loop 18 0.06/0.36 * CEs [22] --> Loop 19 0.06/0.36 * CEs [24] --> Loop 20 0.06/0.36 * CEs [18] --> Loop 21 0.06/0.36 * CEs [19,20] --> Loop 22 0.06/0.36 * CEs [21] --> Loop 23 0.06/0.36 0.06/0.36 ### Ranking functions of CR eval_heapsort_bb0_in(V_size,B) 0.06/0.36 0.06/0.36 #### Partial ranking functions of CR eval_heapsort_bb0_in(V_size,B) 0.06/0.36 0.06/0.36 0.06/0.36 ### Specialization of cost equations eval_heapsort_start/2 0.06/0.36 * CE 1 is refined into CE [25,26,27,28,29,30] 0.06/0.36 0.06/0.36 0.06/0.36 ### Cost equations --> "Loop" of eval_heapsort_start/2 0.06/0.36 * CEs [30] --> Loop 24 0.06/0.36 * CEs [29] --> Loop 25 0.06/0.36 * CEs [28] --> Loop 26 0.06/0.36 * CEs [27] --> Loop 27 0.06/0.36 * CEs [26] --> Loop 28 0.06/0.36 * CEs [25] --> Loop 29 0.06/0.36 0.06/0.36 ### Ranking functions of CR eval_heapsort_start(V_size,B) 0.06/0.36 0.06/0.36 #### Partial ranking functions of CR eval_heapsort_start(V_size,B) 0.06/0.36 0.06/0.36 0.06/0.36 Computing Bounds 0.06/0.36 ===================================== 0.06/0.36 0.06/0.36 #### Cost of chains of eval_heapsort_bb1_in(V_size,V_i_0,B): 0.06/0.36 * Chain [[11,12],16]: 1*it(11)+1*it(12)+0 0.06/0.36 Such that:it(11) =< V_size/4-V_i_0/2 0.06/0.36 aux(3) =< V_size/2-V_i_0 0.06/0.36 it(11) =< aux(3) 0.06/0.36 it(12) =< aux(3) 0.06/0.36 0.06/0.36 with precondition: [B=2,V_i_0>=1,V_size>=4*V_i_0]
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