details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.290236949921 seconds
cpu usage	0.184511672
max memory	8650752.0

stage attributes

key	value
output-size	3751
starexec-result	WORST_CASE(?,O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/4,eval_foo_bb2_in/4] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb3_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/3] 5. non_recursive : [eval_foo_start/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_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_foo_bb0_in/3 5. SCC is partially evaluated into eval_foo_start/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/4 * CE 7 is discarded (unfeasible) * CE 6 is refined into CE [8] * CE 4 is refined into CE [9] * CE 5 is refined into CE [10] ### Cost equations --> "Loop" of eval_foo_bb1_in/4 * CEs [9] --> Loop 8 * CEs [10] --> Loop 9 * CEs [8] --> Loop 10 ### Ranking functions of CR eval_foo_bb1_in(V_x,V__1,V__0,B) * RF of phase [8]: [V_x-V__0,V_x-V__1] #### Partial ranking functions of CR eval_foo_bb1_in(V_x,V__1,V__0,B) * Partial RF of phase [8]: - RF of loop [8:1]: V_x-V__0 V_x-V__1 ### Specialization of cost equations eval_foo_bb0_in/3 * CE 3 is refined into CE [11,12] * CE 2 is refined into CE [13] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [12] --> Loop 11 * CEs [13] --> Loop 12 * CEs [11] --> Loop 13 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) ### Specialization of cost equations eval_foo_start/5 * CE 1 is refined into CE [14,15,16] ### Cost equations --> "Loop" of eval_foo_start/5 * CEs [16] --> Loop 14 * CEs [15] --> Loop 15 * CEs [14] --> Loop 16 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_res,V_min,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_res,V_min,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V_x,V__1,V__0,B): * Chain [[8],9,10]: 1*it(8)+1 Such that:it(8) =< V_x-V__0 with precondition: [B=2,V__1=V__0,V_x>=V__1+1] * Chain [10]: 0 with precondition: [B=2,V_x>=V__1,V__0>=V__1+1] * Chain [9,10]: 1 with precondition: [B=2,V_x=V__1,V_x=V__0] #### Cost of chains of eval_foo_bb0_in(V_x,V_y,B): * Chain [13]: 1 with precondition: [V_y=V_x] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445