Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745568
details
property
value
status
complete
benchmark
Loopus2011_ex1.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
Loopus
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.38165807724 seconds
cpu usage
0.302301054
max memory
8863744.0
stage attributes
key
value
output-size
5943
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_Loopus2011_ex1_2/6,eval_Loopus2011_ex1_3/7,eval_Loopus2011_ex1_bb3_in/6,eval_Loopus2011_ex1_bb4_in/6,eval_Loopus2011_ex1_bb5_in/7] 1. recursive : [eval_Loopus2011_ex1__critedge_in/5,eval_Loopus2011_ex1_bb1_in/3,eval_Loopus2011_ex1_bb2_in/3,eval_Loopus2011_ex1_bb3_in_loop_cont/6] 2. non_recursive : [eval_Loopus2011_ex1_stop/1] 3. non_recursive : [eval_Loopus2011_ex1_bb6_in/1] 4. non_recursive : [eval_Loopus2011_ex1_bb1_in_loop_cont/2] 5. non_recursive : [eval_Loopus2011_ex1_bb0_in/2] 6. non_recursive : [eval_Loopus2011_ex1_start/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_Loopus2011_ex1_bb3_in/6 1. SCC is partially evaluated into eval_Loopus2011_ex1_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_Loopus2011_ex1_bb0_in/2 6. SCC is partially evaluated into eval_Loopus2011_ex1_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_Loopus2011_ex1_bb3_in/6 * CE 6 is refined into CE [9] * CE 8 is refined into CE [10] * CE 7 is refined into CE [11] ### Cost equations --> "Loop" of eval_Loopus2011_ex1_bb3_in/6 * CEs [11] --> Loop 8 * CEs [9] --> Loop 9 * CEs [10] --> Loop 10 ### Ranking functions of CR eval_Loopus2011_ex1_bb3_in(V_n,V_j_0,V_i_1,B,C,D) * RF of phase [8]: [V_n-V_i_1] #### Partial ranking functions of CR eval_Loopus2011_ex1_bb3_in(V_n,V_j_0,V_i_1,B,C,D) * Partial RF of phase [8]: - RF of loop [8:1]: V_n-V_i_1 ### Specialization of cost equations eval_Loopus2011_ex1_bb1_in/3 * CE 5 is refined into CE [12] * CE 3 is refined into CE [13,14] * CE 4 is refined into CE [15,16] ### Cost equations --> "Loop" of eval_Loopus2011_ex1_bb1_in/3 * CEs [16] --> Loop 11 * CEs [15] --> Loop 12 * CEs [14] --> Loop 13 * CEs [13] --> Loop 14 * CEs [12] --> Loop 15 ### Ranking functions of CR eval_Loopus2011_ex1_bb1_in(V_n,V_i_0,B) * RF of phase [11,13]: [V_n-V_i_0-1] #### Partial ranking functions of CR eval_Loopus2011_ex1_bb1_in(V_n,V_i_0,B) * Partial RF of phase [11,13]: - RF of loop [11:1]: V_n-V_i_0-2 - RF of loop [13:1]: V_n-V_i_0-1 ### Specialization of cost equations eval_Loopus2011_ex1_bb0_in/2 * CE 2 is refined into CE [17,18,19,20] ### Cost equations --> "Loop" of eval_Loopus2011_ex1_bb0_in/2 * CEs [20] --> Loop 16 * CEs [19] --> Loop 17 * CEs [18] --> Loop 18 * CEs [17] --> Loop 19 ### Ranking functions of CR eval_Loopus2011_ex1_bb0_in(V_n,B) #### Partial ranking functions of CR eval_Loopus2011_ex1_bb0_in(V_n,B) ### Specialization of cost equations eval_Loopus2011_ex1_start/2 * CE 1 is refined into CE [21,22,23,24] ### Cost equations --> "Loop" of eval_Loopus2011_ex1_start/2 * CEs [24] --> Loop 20 * CEs [23] --> Loop 21 * CEs [22] --> Loop 22 * CEs [21] --> Loop 23
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445