Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745814
details
property
value
status
complete
benchmark
insertsort.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.315836906433 seconds
cpu usage
0.235615264
max memory
8900608.0
stage attributes
key
value
output-size
5013
starexec-result
WORST_CASE(?,O(n^2))
output
/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^2)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_insertsort_3/4,eval_insertsort_4/5,eval_insertsort_bb3_in/4,eval_insertsort_bb4_in/4,eval_insertsort_bb5_in/5] 1. recursive : [eval_insertsort_0/3,eval_insertsort_1/4,eval_insertsort_bb1_in/3,eval_insertsort_bb2_in/3,eval_insertsort_bb3_in_loop_cont/6,eval_insertsort_bb6_in/5] 2. non_recursive : [eval_insertsort_stop/1] 3. non_recursive : [eval_insertsort_bb7_in/1] 4. non_recursive : [eval_insertsort_bb1_in_loop_cont/2] 5. non_recursive : [eval_insertsort_bb0_in/2] 6. non_recursive : [eval_insertsort_start/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_insertsort_bb3_in/4 1. SCC is partially evaluated into eval_insertsort_bb1_in/3 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is completely evaluated into other SCCs 5. SCC is partially evaluated into eval_insertsort_bb0_in/2 6. SCC is partially evaluated into eval_insertsort_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_insertsort_bb3_in/4 * CE 5 is refined into CE [8] * CE 7 is refined into CE [9] * CE 6 is refined into CE [10] ### Cost equations --> "Loop" of eval_insertsort_bb3_in/4 * CEs [10] --> Loop 8 * CEs [8] --> Loop 9 * CEs [9] --> Loop 10 ### Ranking functions of CR eval_insertsort_bb3_in(V_1,V_j_0,B,C) * RF of phase [8]: [V_j_0+1] #### Partial ranking functions of CR eval_insertsort_bb3_in(V_1,V_j_0,B,C) * Partial RF of phase [8]: - RF of loop [8:1]: V_j_0+1 ### Specialization of cost equations eval_insertsort_bb1_in/3 * CE 4 is refined into CE [11] * CE 3 is refined into CE [12,13,14] ### Cost equations --> "Loop" of eval_insertsort_bb1_in/3 * CEs [14] --> Loop 11 * CEs [12,13] --> Loop 12 * CEs [11] --> Loop 13 ### Ranking functions of CR eval_insertsort_bb1_in(V_length,V_i_0,B) * RF of phase [11,12]: [V_length-V_i_0] #### Partial ranking functions of CR eval_insertsort_bb1_in(V_length,V_i_0,B) * Partial RF of phase [11,12]: - RF of loop [11:1,12:1]: V_length-V_i_0 ### Specialization of cost equations eval_insertsort_bb0_in/2 * CE 2 is refined into CE [15,16] ### Cost equations --> "Loop" of eval_insertsort_bb0_in/2 * CEs [16] --> Loop 14 * CEs [15] --> Loop 15 ### Ranking functions of CR eval_insertsort_bb0_in(V_length,B) #### Partial ranking functions of CR eval_insertsort_bb0_in(V_length,B) ### Specialization of cost equations eval_insertsort_start/2 * CE 1 is refined into CE [17,18] ### Cost equations --> "Loop" of eval_insertsort_start/2 * CEs [18] --> Loop 16 * CEs [17] --> Loop 17 ### Ranking functions of CR eval_insertsort_start(V_length,B) #### Partial ranking functions of CR eval_insertsort_start(V_length,B) Computing Bounds =====================================
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445