Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744879
details
property
value
status
complete
benchmark
heapsort.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
1.31691193581 seconds
cpu usage
1.231747163
max memory
1.1268096E7
stage attributes
key
value
output-size
10575
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_heapsort_14/16,eval_heapsort_15/16,eval_heapsort_17/16,eval_heapsort_18/16,eval_heapsort_bb10_in/16,eval_heapsort_bb1_in/16,eval_heapsort_bb2_in/16,eval_heapsort_bb3_in/16,eval_heapsort_bb4_in/16,eval_heapsort_bb5_in/16,eval_heapsort_bb6_in/16,eval_heapsort_bb7_in/16,eval_heapsort_bb8_in/16,eval_heapsort_bb9_in/16] 1. non_recursive : [eval_heapsort_stop/9] 2. non_recursive : [eval_heapsort_bb11_in/9] 3. non_recursive : [exit_location/1] 4. non_recursive : [eval_heapsort_bb1_in_loop_cont/10] 5. non_recursive : [eval_heapsort_9/9] 6. non_recursive : [eval_heapsort_8/9] 7. non_recursive : [eval_heapsort_7/9] 8. non_recursive : [eval_heapsort_6/9] 9. non_recursive : [eval_heapsort_5/9] 10. non_recursive : [eval_heapsort_4/9] 11. non_recursive : [eval_heapsort_3/9] 12. non_recursive : [eval_heapsort_2/9] 13. non_recursive : [eval_heapsort_1/9] 14. non_recursive : [eval_heapsort_0/9] 15. non_recursive : [eval_heapsort_bb0_in/9] 16. non_recursive : [eval_heapsort_start/9] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_heapsort_bb1_in/16 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into eval_heapsort_bb1_in_loop_cont/10 5. SCC is partially evaluated into eval_heapsort_9/9 6. SCC is completely evaluated into other SCCs 7. SCC is completely evaluated into other SCCs 8. SCC is completely evaluated into other SCCs 9. SCC is completely evaluated into other SCCs 10. SCC is completely evaluated into other SCCs 11. SCC is completely evaluated into other SCCs 12. SCC is completely evaluated into other SCCs 13. SCC is completely evaluated into other SCCs 14. SCC is completely evaluated into other SCCs 15. SCC is completely evaluated into other SCCs 16. SCC is partially evaluated into eval_heapsort_start/9 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_heapsort_bb1_in/16 * CE 12 is refined into CE [15] * CE 7 is refined into CE [16] * CE 3 is refined into CE [17] * CE 10 is refined into CE [18] * CE 11 is discarded (unfeasible) * CE 5 is refined into CE [19] * CE 9 is refined into CE [20] * CE 6 is refined into CE [21] * CE 8 is refined into CE [22] * CE 4 is refined into CE [23] ### Cost equations --> "Loop" of eval_heapsort_bb1_in/16 * CEs [20] --> Loop 15 * CEs [21] --> Loop 16 * CEs [22] --> Loop 17 * CEs [23] --> Loop 18 * CEs [15] --> Loop 19 * CEs [16] --> Loop 20 * CEs [17] --> Loop 21 * CEs [19] --> Loop 22 * CEs [18] --> Loop 23 ### Ranking functions of CR eval_heapsort_bb1_in(V_13,V_2,V_4,V_8,V_i_0,V_max_1,V_max_3,V_size,B,C,D,E,F,G,H,I) * RF of phase [15,16,17]: [-V_i_0+V_size/2] #### Partial ranking functions of CR eval_heapsort_bb1_in(V_13,V_2,V_4,V_8,V_i_0,V_max_1,V_max_3,V_size,B,C,D,E,F,G,H,I) * Partial RF of phase [15,16,17]: - RF of loop [15:1,16:1]: -V_i_0/2+V_size/4 - RF of loop [17:1]: -V_i_0+V_size/2 ### Specialization of cost equations eval_heapsort_bb1_in_loop_cont/10 * CE 14 is refined into CE [24] * CE 13 is refined into CE [25] ### Cost equations --> "Loop" of eval_heapsort_bb1_in_loop_cont/10 * CEs [24] --> Loop 24 * CEs [25] --> Loop 25 ### Ranking functions of CR eval_heapsort_bb1_in_loop_cont(A,B,C,D,E,F,G,H,I,J) #### Partial ranking functions of CR eval_heapsort_bb1_in_loop_cont(A,B,C,D,E,F,G,H,I,J)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843