details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.255175113678 seconds
cpu usage	0.173046515
max memory	8359936.0

stage attributes

key	value
output-size	4439
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_exmini_bb1_in/4,eval_exmini_bb2_in/4] 1. non_recursive : [eval_exmini_stop/1] 2. non_recursive : [eval_exmini_bb3_in/1] 3. non_recursive : [eval_exmini_bb1_in_loop_cont/2] 4. non_recursive : [eval_exmini_bb0_in/4] 5. non_recursive : [eval_exmini_start/4] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_exmini_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_exmini_bb0_in/4 5. SCC is partially evaluated into eval_exmini_start/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_exmini_bb1_in/4 * CE 5 is refined into CE [6] * CE 4 is refined into CE [7] * CE 3 is refined into CE [8] ### Cost equations --> "Loop" of eval_exmini_bb1_in/4 * CEs [8] --> Loop 6 * CEs [6] --> Loop 7 * CEs [7] --> Loop 8 ### Ranking functions of CR eval_exmini_bb1_in(V__02,V__01,V__0,B) * RF of phase [6]: [V__02/2-V__01/2-V__0/2+101/2] #### Partial ranking functions of CR eval_exmini_bb1_in(V__02,V__01,V__0,B) * Partial RF of phase [6]: - RF of loop [6:1]: V__02/2-V__01/2-V__0/2+101/2 ### Specialization of cost equations eval_exmini_bb0_in/4 * CE 2 is refined into CE [9,10,11,12] ### Cost equations --> "Loop" of eval_exmini_bb0_in/4 * CEs [12] --> Loop 9 * CEs [11] --> Loop 10 * CEs [10] --> Loop 11 * CEs [9] --> Loop 12 ### Ranking functions of CR eval_exmini_bb0_in(V_i,V_j,V_k,B) #### Partial ranking functions of CR eval_exmini_bb0_in(V_i,V_j,V_k,B) ### Specialization of cost equations eval_exmini_start/4 * CE 1 is refined into CE [13,14,15,16] ### Cost equations --> "Loop" of eval_exmini_start/4 * CEs [16] --> Loop 13 * CEs [15] --> Loop 14 * CEs [14] --> Loop 15 * CEs [13] --> Loop 16 ### Ranking functions of CR eval_exmini_start(V_i,V_j,V_k,B) #### Partial ranking functions of CR eval_exmini_start(V_i,V_j,V_k,B) Computing Bounds ===================================== #### Cost of chains of eval_exmini_bb1_in(V__02,V__01,V__0,B): * Chain [[6],8]: 1*it(6)+0 Such that:it(6) =< V__02 it(6) =< V__02/2-V__01/2-V__0/2+101/2 with precondition: [B=2,100>=V__0,V__02>=101,V__02>=V__01] * Chain [[6],7]: 1*it(6)+0 Such that:it(6) =< V__02/2-V__01/2-V__0/2+101/2 with precondition: [B=2,100>=V__0,V__02>=V__01] * Chain [8]: 0 with precondition: [B=2,V__0>=101] * Chain [7]: 0 with precondition: [B=2,V__01>=V__02+1] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445