details

property	value
status	complete
benchmark	speed_pldi09_fig1.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n071.star.cs.uiowa.edu
space	C4B_examples

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.324393987656 seconds
cpu usage	0.185272552
max memory	8773632.0

stage attributes

key	value
output-size	3834
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_pldi09_fig1_bb1_in/4,eval_speed_pldi09_fig1_bb2_in/4,eval_speed_pldi09_fig1_bb3_in/4,eval_speed_pldi09_fig1_bb4_in/4] 1. non_recursive : [eval_speed_pldi09_fig1_stop/1] 2. non_recursive : [eval_speed_pldi09_fig1_bb5_in/1] 3. non_recursive : [eval_speed_pldi09_fig1_bb1_in_loop_cont/2] 4. non_recursive : [eval_speed_pldi09_fig1_bb0_in/2] 5. non_recursive : [eval_speed_pldi09_fig1_start/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_speed_pldi09_fig1_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_speed_pldi09_fig1_bb0_in/2 5. SCC is partially evaluated into eval_speed_pldi09_fig1_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_speed_pldi09_fig1_bb1_in/4 * CE 4 is refined into CE [6] * CE 5 is refined into CE [7] * CE 3 is refined into CE [8] ### Cost equations --> "Loop" of eval_speed_pldi09_fig1_bb1_in/4 * CEs [8] --> Loop 6 * CEs [6] --> Loop 7 * CEs [7] --> Loop 8 ### Ranking functions of CR eval_speed_pldi09_fig1_bb1_in(V_n,V_y_0,V_x_0,B) * RF of phase [7]: [V_y_0] * RF of phase [8]: [V_n-V_x_0,V_n-V_y_0] #### Partial ranking functions of CR eval_speed_pldi09_fig1_bb1_in(V_n,V_y_0,V_x_0,B) * Partial RF of phase [7]: - RF of loop [7:1]: V_y_0 * Partial RF of phase [8]: - RF of loop [8:1]: V_n-V_x_0 V_n-V_y_0 ### Specialization of cost equations eval_speed_pldi09_fig1_bb0_in/2 * CE 2 is refined into CE [9,10] ### Cost equations --> "Loop" of eval_speed_pldi09_fig1_bb0_in/2 * CEs [10] --> Loop 9 * CEs [9] --> Loop 10 ### Ranking functions of CR eval_speed_pldi09_fig1_bb0_in(V_n,B) #### Partial ranking functions of CR eval_speed_pldi09_fig1_bb0_in(V_n,B) ### Specialization of cost equations eval_speed_pldi09_fig1_start/2 * CE 1 is refined into CE [11,12] ### Cost equations --> "Loop" of eval_speed_pldi09_fig1_start/2 * CEs [12] --> Loop 11 * CEs [11] --> Loop 12 ### Ranking functions of CR eval_speed_pldi09_fig1_start(V_n,B) #### Partial ranking functions of CR eval_speed_pldi09_fig1_start(V_n,B) Computing Bounds ===================================== #### Cost of chains of eval_speed_pldi09_fig1_bb1_in(V_n,V_y_0,V_x_0,B): * Chain [[8],[7],6]: 1*it(7)+1*it(8)+0 Such that:it(7) =< V_n it(8) =< V_n-V_x_0 with precondition: [B=2,V_y_0=V_x_0,V_y_0>=0,V_n>=V_y_0+1] * Chain [6]: 0 with precondition: [V_y_0=0,B=2,V_x_0>=0,V_x_0>=V_n] #### Cost of chains of eval_speed_pldi09_fig1_bb0_in(V_n,B): * Chain [10]: 0 with precondition: [0>=V_n] * Chain [9]: 2*s(1)+0 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl C Integ Progr 85445