Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429989883
details
property
value
status
complete
benchmark
insertsort.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.530296 seconds
cpu usage
0.449482
user time
0.435157
system time
0.014325
max virtual memory
315368.0
max residence set size
12160.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(n^2))
output
0.04/0.42 WORST_CASE(?,O(n^2)) 0.04/0.42 0.04/0.42 Preprocessing Cost Relations 0.04/0.42 ===================================== 0.04/0.42 0.04/0.42 #### Computed strongly connected components 0.04/0.42 0. recursive : [eval_insertsort_bb3_in/4,eval_insertsort_bb4_in/4,eval_insertsort_bb5_in/4] 0.04/0.42 1. recursive : [eval_insertsort_25/10,eval_insertsort_26/10,eval_insertsort_bb1_in/10,eval_insertsort_bb2_in/10,eval_insertsort_bb3_in_loop_cont/11,eval_insertsort_bb6_in/10] 0.04/0.42 2. non_recursive : [eval_insertsort_stop/6] 0.04/0.42 3. non_recursive : [eval_insertsort_bb7_in/6] 0.04/0.42 4. non_recursive : [exit_location/1] 0.04/0.42 5. non_recursive : [eval_insertsort_bb1_in_loop_cont/7] 0.04/0.42 6. non_recursive : [eval_insertsort_6/6] 0.04/0.42 7. non_recursive : [eval_insertsort_5/6] 0.04/0.42 8. non_recursive : [eval_insertsort_4/6] 0.04/0.42 9. non_recursive : [eval_insertsort_3/6] 0.04/0.42 10. non_recursive : [eval_insertsort_2/6] 0.04/0.42 11. non_recursive : [eval_insertsort_1/6] 0.04/0.42 12. non_recursive : [eval_insertsort_0/6] 0.04/0.42 13. non_recursive : [eval_insertsort_bb0_in/6] 0.04/0.42 14. non_recursive : [eval_insertsort_start/6] 0.04/0.42 0.04/0.42 #### Obtained direct recursion through partial evaluation 0.04/0.42 0. SCC is partially evaluated into eval_insertsort_bb3_in/4 0.04/0.42 1. SCC is partially evaluated into eval_insertsort_bb1_in/10 0.04/0.42 2. SCC is completely evaluated into other SCCs 0.04/0.42 3. SCC is completely evaluated into other SCCs 0.04/0.42 4. SCC is completely evaluated into other SCCs 0.04/0.42 5. SCC is partially evaluated into eval_insertsort_bb1_in_loop_cont/7 0.04/0.42 6. SCC is partially evaluated into eval_insertsort_6/6 0.04/0.42 7. SCC is completely evaluated into other SCCs 0.04/0.42 8. SCC is completely evaluated into other SCCs 0.04/0.42 9. SCC is completely evaluated into other SCCs 0.04/0.42 10. SCC is completely evaluated into other SCCs 0.04/0.42 11. SCC is completely evaluated into other SCCs 0.04/0.42 12. SCC is completely evaluated into other SCCs 0.04/0.42 13. SCC is completely evaluated into other SCCs 0.04/0.42 14. SCC is partially evaluated into eval_insertsort_start/6 0.04/0.42 0.04/0.42 Control-Flow Refinement of Cost Relations 0.04/0.42 ===================================== 0.04/0.42 0.04/0.42 ### Specialization of cost equations eval_insertsort_bb3_in/4 0.04/0.42 * CE 12 is refined into CE [13] 0.04/0.42 * CE 9 is refined into CE [14] 0.04/0.42 * CE 11 is refined into CE [15] 0.04/0.42 * CE 10 is refined into CE [16] 0.04/0.42 0.04/0.42 0.04/0.42 ### Cost equations --> "Loop" of eval_insertsort_bb3_in/4 0.04/0.42 * CEs [16] --> Loop 13 0.04/0.42 * CEs [13] --> Loop 14 0.04/0.42 * CEs [14] --> Loop 15 0.04/0.42 * CEs [15] --> Loop 16 0.04/0.42 0.04/0.42 ### Ranking functions of CR eval_insertsort_bb3_in(V_3,V_j_0,B,C) 0.04/0.42 * RF of phase [13]: [V_j_0+1] 0.04/0.42 0.04/0.42 #### Partial ranking functions of CR eval_insertsort_bb3_in(V_3,V_j_0,B,C) 0.04/0.42 * Partial RF of phase [13]: 0.04/0.42 - RF of loop [13:1]: 0.04/0.42 V_j_0+1 0.04/0.42 0.04/0.42 0.04/0.42 ### Specialization of cost equations eval_insertsort_bb1_in/10 0.04/0.42 * CE 5 is refined into CE [17] 0.04/0.42 * CE 3 is refined into CE [18,19] 0.04/0.42 * CE 6 is refined into CE [20] 0.04/0.42 * CE 4 is refined into CE [21,22,23] 0.04/0.42 0.04/0.42 0.04/0.42 ### Cost equations --> "Loop" of eval_insertsort_bb1_in/10 0.04/0.42 * CEs [23] --> Loop 17 0.04/0.42 * CEs [22] --> Loop 18 0.04/0.42 * CEs [21] --> Loop 19 0.04/0.42 * CEs [17] --> Loop 20 0.04/0.42 * CEs [18,19] --> Loop 21 0.04/0.42 * CEs [20] --> Loop 22 0.04/0.42 0.04/0.42 ### Ranking functions of CR eval_insertsort_bb1_in(V_20,V_3,V_i_0,V_j_0,V_length,B,C,D,E,F) 0.04/0.42 * RF of phase [17,18,19]: [-V_i_0+V_length] 0.04/0.42 0.04/0.42 #### Partial ranking functions of CR eval_insertsort_bb1_in(V_20,V_3,V_i_0,V_j_0,V_length,B,C,D,E,F) 0.04/0.42 * Partial RF of phase [17,18,19]: 0.04/0.42 - RF of loop [17:1,18:1,19:1]: 0.04/0.42 -V_i_0+V_length 0.04/0.42 0.04/0.42 0.04/0.42 ### Specialization of cost equations eval_insertsort_bb1_in_loop_cont/7 0.04/0.42 * CE 7 is refined into CE [24] 0.04/0.42 * CE 8 is refined into CE [25] 0.04/0.42 0.04/0.42 0.04/0.42 ### Cost equations --> "Loop" of eval_insertsort_bb1_in_loop_cont/7 0.04/0.42 * CEs [24] --> Loop 23 0.04/0.42 * CEs [25] --> Loop 24 0.04/0.42 0.04/0.42 ### Ranking functions of CR eval_insertsort_bb1_in_loop_cont(A,B,C,D,E,F,G) 0.04/0.42 0.04/0.42 #### Partial ranking functions of CR eval_insertsort_bb1_in_loop_cont(A,B,C,D,E,F,G)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_ITS 2019-03-21 04.46