Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745963
details
property
value
status
complete
benchmark
aaron3.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n028.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.296514987946 seconds
cpu usage
0.217041886
max memory
8593408.0
stage attributes
key
value
output-size
3937
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_aaron3_0/4,eval_aaron3_1/5,eval_aaron3_3/6,eval_aaron3_4/7,eval_aaron3_bb1_in/4,eval_aaron3_bb2_in/4,eval_aaron3_bb3_in/5,eval_aaron3_bb4_in/5] 1. non_recursive : [eval_aaron3_stop/1] 2. non_recursive : [eval_aaron3_bb5_in/1] 3. non_recursive : [eval_aaron3_bb1_in_loop_cont/2] 4. non_recursive : [eval_aaron3_bb0_in/4] 5. non_recursive : [eval_aaron3_start/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_aaron3_bb1_in/4 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_aaron3_bb0_in/4 5. SCC is partially evaluated into eval_aaron3_start/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_aaron3_bb1_in/4 * CE 6 is refined into CE [7] * CE 4 is refined into CE [8] * CE 3 is refined into CE [9] * CE 5 is refined into CE [10] ### Cost equations --> "Loop" of eval_aaron3_bb1_in/4 * CEs [9] --> Loop 7 * CEs [10] --> Loop 8 * CEs [7] --> Loop 9 * CEs [8] --> Loop 10 ### Ranking functions of CR eval_aaron3_bb1_in(V__04,V__02,V__01,B) #### Partial ranking functions of CR eval_aaron3_bb1_in(V__04,V__02,V__01,B) * Partial RF of phase [7,8]: - RF of loop [7:1]: -V__02+V__01+1 depends on loops [8:1] ### Specialization of cost equations eval_aaron3_bb0_in/4 * CE 2 is refined into CE [11,12,13] ### Cost equations --> "Loop" of eval_aaron3_bb0_in/4 * CEs [13] --> Loop 11 * CEs [11] --> Loop 12 * CEs [12] --> Loop 13 ### Ranking functions of CR eval_aaron3_bb0_in(V_x,V_y,V_z,B) #### Partial ranking functions of CR eval_aaron3_bb0_in(V_x,V_y,V_z,B) ### Specialization of cost equations eval_aaron3_start/5 * CE 1 is refined into CE [14,15,16] ### Cost equations --> "Loop" of eval_aaron3_start/5 * CEs [16] --> Loop 14 * CEs [15] --> Loop 15 * CEs [14] --> Loop 16 ### Ranking functions of CR eval_aaron3_start(V_x,V_y,V_z,V_tx,B) #### Partial ranking functions of CR eval_aaron3_start(V_x,V_y,V_z,V_tx,B) Computing Bounds ===================================== #### Cost of chains of eval_aaron3_bb1_in(V__04,V__02,V__01,B): * Chain [[7,8]]...: 2*it(7)+0 with precondition: [V__01>=V__02,B=2] * Chain [[7,8],10]: 2*it(7)+0 with precondition: [B=2,V__01>=V__02] * Chain [[7,8],9]: 2*it(7)+0 with precondition: [B=2,V__01>=V__02] * Chain [10]: 0 with precondition: [B=2,V__01>=V__02] * Chain [9]: 0 with precondition: [B=2,V__02>=V__01+1] #### Cost of chains of eval_aaron3_bb0_in(V_x,V_y,V_z,B):
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445