Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745858
details
property
value
status
complete
benchmark
speed_pldi10_ex4.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n094.star.cs.uiowa.edu
space
C4B_examples
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.27247095108 seconds
cpu usage
0.188419758
max memory
8519680.0
stage attributes
key
value
output-size
4423
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_speed_pldi10_ex4_bb2_in/7,eval_speed_pldi10_ex4_bb3_in/7] 1. recursive : [eval_speed_pldi10_ex4_bb1_in/3,eval_speed_pldi10_ex4_bb2_in_loop_cont/4] 2. non_recursive : [eval_speed_pldi10_ex4_stop/1] 3. non_recursive : [eval_speed_pldi10_ex4_bb4_in/1] 4. non_recursive : [eval_speed_pldi10_ex4_bb1_in_loop_cont/2] 5. non_recursive : [eval_speed_pldi10_ex4_bb0_in/2] 6. non_recursive : [eval_speed_pldi10_ex4_start/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_speed_pldi10_ex4_bb2_in/7 1. SCC is partially evaluated into eval_speed_pldi10_ex4_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_speed_pldi10_ex4_bb0_in/2 6. SCC is partially evaluated into eval_speed_pldi10_ex4_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_speed_pldi10_ex4_bb2_in/7 * CE 6 is refined into CE [7] * CE 5 is refined into CE [8] ### Cost equations --> "Loop" of eval_speed_pldi10_ex4_bb2_in/7 * CEs [8] --> Loop 7 * CEs [7] --> Loop 8 ### Ranking functions of CR eval_speed_pldi10_ex4_bb2_in(V_flag_0,V__0,V_flag_1,V__1,B,C,D) * RF of phase [7]: [V__1] #### Partial ranking functions of CR eval_speed_pldi10_ex4_bb2_in(V_flag_0,V__0,V_flag_1,V__1,B,C,D) * Partial RF of phase [7]: - RF of loop [7:1]: V__1 ### Specialization of cost equations eval_speed_pldi10_ex4_bb1_in/3 * CE 4 is refined into CE [9] * CE 3 is refined into CE [10,11] ### Cost equations --> "Loop" of eval_speed_pldi10_ex4_bb1_in/3 * CEs [10] --> Loop 9 * CEs [11] --> Loop 10 * CEs [9] --> Loop 11 ### Ranking functions of CR eval_speed_pldi10_ex4_bb1_in(V_flag_0,V__0,B) #### Partial ranking functions of CR eval_speed_pldi10_ex4_bb1_in(V_flag_0,V__0,B) ### Specialization of cost equations eval_speed_pldi10_ex4_bb0_in/2 * CE 2 is refined into CE [12,13] ### Cost equations --> "Loop" of eval_speed_pldi10_ex4_bb0_in/2 * CEs [13] --> Loop 12 * CEs [12] --> Loop 13 ### Ranking functions of CR eval_speed_pldi10_ex4_bb0_in(V_n,B) #### Partial ranking functions of CR eval_speed_pldi10_ex4_bb0_in(V_n,B) ### Specialization of cost equations eval_speed_pldi10_ex4_start/2 * CE 1 is refined into CE [14,15] ### Cost equations --> "Loop" of eval_speed_pldi10_ex4_start/2 * CEs [15] --> Loop 14 * CEs [14] --> Loop 15 ### Ranking functions of CR eval_speed_pldi10_ex4_start(V_n,B) #### Partial ranking functions of CR eval_speed_pldi10_ex4_start(V_n,B) Computing Bounds ===================================== #### Cost of chains of eval_speed_pldi10_ex4_bb2_in(V_flag_0,V__0,V_flag_1,V__1,B,C,D): * Chain [[7],8]: 1*it(7)+0 Such that:it(7) =< V__1 with precondition: [B=2,C=1,D=0,1>=V_flag_1,V_flag_0>=1,V__1>=1]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445