Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745799
details
property
value
status
complete
benchmark
speed_pldi09_fig4_2.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.297020196915 seconds
cpu usage
0.215267489
max memory
8761344.0
stage attributes
key
value
output-size
4331
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_peed_pldi09_fig4_2_bb1_in/4,eval_peed_pldi09_fig4_2_bb2_in/4,eval_peed_pldi09_fig4_2_bb3_in/4] 1. non_recursive : [eval_peed_pldi09_fig4_2_stop/1] 2. non_recursive : [eval_peed_pldi09_fig4_2_bb4_in/1] 3. non_recursive : [eval_peed_pldi09_fig4_2_bb1_in_loop_cont/2] 4. non_recursive : [eval_peed_pldi09_fig4_2_bb0_in/3] 5. non_recursive : [eval_peed_pldi09_fig4_2_start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_peed_pldi09_fig4_2_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_peed_pldi09_fig4_2_bb0_in/3 5. SCC is partially evaluated into eval_peed_pldi09_fig4_2_start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_peed_pldi09_fig4_2_bb1_in/4 * CE 6 is refined into CE [7] * CE 5 is refined into CE [8] * CE 4 is refined into CE [9] ### Cost equations --> "Loop" of eval_peed_pldi09_fig4_2_bb1_in/4 * CEs [8] --> Loop 7 * CEs [9] --> Loop 8 * CEs [7] --> Loop 9 ### Ranking functions of CR eval_peed_pldi09_fig4_2_bb1_in(V_m,V_va_0,V_vb_0,B) * RF of phase [7,8]: [2*V_va_0+V_vb_0-1] #### Partial ranking functions of CR eval_peed_pldi09_fig4_2_bb1_in(V_m,V_va_0,V_vb_0,B) * Partial RF of phase [7,8]: - RF of loop [7:1]: V_m-V_vb_0 depends on loops [8:1] V_va_0 - RF of loop [8:1]: -V_m+V_vb_0+1 depends on loops [7:1] V_vb_0 depends on loops [7:1] ### Specialization of cost equations eval_peed_pldi09_fig4_2_bb0_in/3 * CE 3 is refined into CE [10,11] * CE 2 is refined into CE [12] ### Cost equations --> "Loop" of eval_peed_pldi09_fig4_2_bb0_in/3 * CEs [11] --> Loop 10 * CEs [12] --> Loop 11 * CEs [10] --> Loop 12 ### Ranking functions of CR eval_peed_pldi09_fig4_2_bb0_in(V_n,V_m,B) #### Partial ranking functions of CR eval_peed_pldi09_fig4_2_bb0_in(V_n,V_m,B) ### Specialization of cost equations eval_peed_pldi09_fig4_2_start/3 * CE 1 is refined into CE [13,14,15] ### Cost equations --> "Loop" of eval_peed_pldi09_fig4_2_start/3 * CEs [15] --> Loop 13 * CEs [14] --> Loop 14 * CEs [13] --> Loop 15 ### Ranking functions of CR eval_peed_pldi09_fig4_2_start(V_n,V_m,B) #### Partial ranking functions of CR eval_peed_pldi09_fig4_2_start(V_n,V_m,B) Computing Bounds ===================================== #### Cost of chains of eval_peed_pldi09_fig4_2_bb1_in(V_m,V_va_0,V_vb_0,B): * Chain [[7,8],9]: 1*it(7)+1*it(8)+0 Such that:it(7) =< V_va_0 aux(20) =< 2*V_va_0+V_vb_0 it(7) =< aux(20) it(8) =< aux(20) with precondition: [B=2,V_m>=1,V_va_0>=1,V_vb_0>=0] * Chain [9]: 0 with precondition: [B=2,0>=V_va_0,V_m>=1,V_vb_0>=0] #### Cost of chains of eval_peed_pldi09_fig4_2_bb0_in(V_n,V_m,B):
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445