details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	2.50017 seconds
cpu usage	2.43848
user time	2.39997
system time	0.038514
max virtual memory	317808.0
max residence set size	14796.0

stage attributes

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

output

2.37/2.39 WORST_CASE(?,O(n^1)) 2.37/2.39 2.37/2.39 Preprocessing Cost Relations 2.37/2.39 ===================================== 2.37/2.39 2.37/2.39 #### Computed strongly connected components 2.37/2.39 0. recursive : [eval_Loopus2011_ex2_0/6,eval_Loopus2011_ex2_1/7,eval_Loopus2011_ex2_bb10_in/8,eval_Loopus2011_ex2_bb11_in/10,eval_Loopus2011_ex2_bb1_in/6,eval_Loopus2011_ex2_bb2_in/7,eval_Loopus2011_ex2_bb3_in/7,eval_Loopus2011_ex2_bb4_in/8,eval_Loopus2011_ex2_bb5_in/8,eval_Loopus2011_ex2_bb6_in/8,eval_Loopus2011_ex2_bb7_in/10,eval_Loopus2011_ex2_bb8_in/8,eval_Loopus2011_ex2_bb9_in/8] 2.37/2.39 1. non_recursive : [eval_Loopus2011_ex2_stop/1] 2.37/2.39 2. non_recursive : [eval_Loopus2011_ex2_bb12_in/1] 2.37/2.39 3. non_recursive : [eval_Loopus2011_ex2_bb1_in_loop_cont/2] 2.37/2.39 4. non_recursive : [eval_Loopus2011_ex2_bb0_in/3] 2.37/2.39 5. non_recursive : [eval_Loopus2011_ex2_start/3] 2.37/2.39 2.37/2.39 #### Obtained direct recursion through partial evaluation 2.37/2.39 0. SCC is partially evaluated into eval_Loopus2011_ex2_bb1_in/6 2.37/2.39 1. SCC is completely evaluated into other SCCs 2.37/2.39 2. SCC is completely evaluated into other SCCs 2.37/2.39 3. SCC is completely evaluated into other SCCs 2.37/2.39 4. SCC is partially evaluated into eval_Loopus2011_ex2_bb0_in/3 2.37/2.39 5. SCC is partially evaluated into eval_Loopus2011_ex2_start/3 2.37/2.39 2.37/2.39 Control-Flow Refinement of Cost Relations 2.37/2.39 ===================================== 2.37/2.39 2.37/2.39 ### Specialization of cost equations eval_Loopus2011_ex2_bb1_in/6 2.37/2.39 * CE 34 is refined into CE [56] 2.37/2.39 * CE 8 is refined into CE [57] 2.37/2.39 * CE 30 is discarded (unfeasible) 2.37/2.39 * CE 4 is discarded (unfeasible) 2.37/2.39 * CE 36 is discarded (unfeasible) 2.37/2.39 * CE 10 is discarded (unfeasible) 2.37/2.39 * CE 32 is discarded (unfeasible) 2.37/2.39 * CE 6 is discarded (unfeasible) 2.37/2.39 * CE 55 is refined into CE [58] 2.37/2.39 * CE 12 is discarded (unfeasible) 2.37/2.39 * CE 38 is discarded (unfeasible) 2.37/2.39 * CE 40 is discarded (unfeasible) 2.37/2.39 * CE 14 is discarded (unfeasible) 2.37/2.39 * CE 15 is refined into CE [59] 2.37/2.39 * CE 45 is discarded (unfeasible) 2.37/2.39 * CE 19 is refined into CE [60] 2.37/2.39 * CE 53 is discarded (unfeasible) 2.37/2.39 * CE 27 is discarded (unfeasible) 2.37/2.39 * CE 21 is discarded (unfeasible) 2.37/2.39 * CE 20 is refined into CE [61] 2.37/2.39 * CE 28 is discarded (unfeasible) 2.37/2.39 * CE 46 is refined into CE [62] 2.37/2.39 * CE 54 is discarded (unfeasible) 2.37/2.39 * CE 41 is refined into CE [63] 2.37/2.39 * CE 48 is discarded (unfeasible) 2.37/2.39 * CE 47 is discarded (unfeasible) 2.37/2.39 * CE 22 is discarded (unfeasible) 2.37/2.39 * CE 7 is refined into CE [64] 2.37/2.39 * CE 3 is discarded (unfeasible) 2.37/2.39 * CE 9 is discarded (unfeasible) 2.37/2.39 * CE 5 is discarded (unfeasible) 2.37/2.39 * CE 33 is refined into CE [65] 2.37/2.39 * CE 29 is discarded (unfeasible) 2.37/2.39 * CE 35 is discarded (unfeasible) 2.37/2.39 * CE 31 is discarded (unfeasible) 2.37/2.39 * CE 11 is discarded (unfeasible) 2.37/2.39 * CE 13 is discarded (unfeasible) 2.37/2.39 * CE 37 is discarded (unfeasible) 2.37/2.39 * CE 39 is discarded (unfeasible) 2.37/2.39 * CE 17 is refined into CE [66] 2.37/2.39 * CE 25 is discarded (unfeasible) 2.37/2.39 * CE 18 is refined into CE [67] 2.37/2.39 * CE 26 is discarded (unfeasible) 2.37/2.39 * CE 43 is discarded (unfeasible) 2.37/2.39 * CE 51 is discarded (unfeasible) 2.37/2.39 * CE 44 is refined into CE [68] 2.37/2.39 * CE 52 is discarded (unfeasible) 2.37/2.39 * CE 42 is refined into CE [69] 2.37/2.39 * CE 50 is discarded (unfeasible) 2.37/2.39 * CE 49 is discarded (unfeasible) 2.37/2.39 * CE 16 is refined into CE [70] 2.37/2.39 * CE 24 is discarded (unfeasible) 2.37/2.39 * CE 23 is discarded (unfeasible) 2.37/2.39 2.37/2.39 2.37/2.39 ### Cost equations --> "Loop" of eval_Loopus2011_ex2_bb1_in/6 2.37/2.39 * CEs [64] --> Loop 56 2.37/2.39 * CEs [65] --> Loop 57 2.37/2.39 * CEs [68] --> Loop 58 2.37/2.39 * CEs [66] --> Loop 59 2.37/2.39 * CEs [69] --> Loop 60 2.37/2.39 * CEs [70] --> Loop 61 2.37/2.39 * CEs [67] --> Loop 62 2.37/2.39 * CEs [57] --> Loop 63 2.37/2.39 * CEs [56] --> Loop 64 2.37/2.39 * CEs [58] --> Loop 65 2.37/2.39 * CEs [62] --> Loop 66 2.37/2.39 * CEs [59] --> Loop 67 2.37/2.39 * CEs [63] --> Loop 68 2.37/2.39 * CEs [60] --> Loop 69 2.37/2.39 * CEs [61] --> Loop 70 2.37/2.39 2.37/2.39 ### Ranking functions of CR eval_Loopus2011_ex2_bb1_in(V_r,V_d_0,V_f_0,V_c_0,V__0,B) 2.37/2.39 * RF of phase [58]: [V__0/4-3/4] 2.37/2.39 * RF of phase [59]: [-V__0/4+63] popout

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

job log

popout

actions

all output return to Complexity_C_Integer 2019-03-21 04.38