0.05/0.31	MAYBE
0.05/0.31	
0.05/0.31	Preprocessing Cost Relations
0.05/0.31	=====================================
0.05/0.31	
0.05/0.31	#### Computed strongly connected components 
0.05/0.31	0. recursive  : [eval_foo_bb1_in/2,eval_foo_bb2_in/2,eval_foo_bb3_in/2,eval_foo_bb4_in/2,eval_foo_bb5_in/2]
0.05/0.31	1. non_recursive  : [eval_foo_stop/1]
0.05/0.31	2. non_recursive  : [eval_foo_bb6_in/1]
0.05/0.31	3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
0.05/0.31	4. non_recursive  : [eval_foo_bb0_in/2]
0.05/0.31	5. non_recursive  : [eval_foo_start/3]
0.05/0.31	
0.05/0.31	#### Obtained direct recursion through partial evaluation 
0.05/0.31	0. SCC is partially evaluated into eval_foo_bb1_in/2
0.05/0.31	1. SCC is completely evaluated into other SCCs
0.05/0.31	2. SCC is completely evaluated into other SCCs
0.05/0.31	3. SCC is completely evaluated into other SCCs
0.05/0.31	4. SCC is partially evaluated into eval_foo_bb0_in/2
0.05/0.31	5. SCC is partially evaluated into eval_foo_start/3
0.05/0.31	
0.05/0.31	Control-Flow Refinement of Cost Relations
0.05/0.31	=====================================
0.05/0.31	
0.05/0.31	### Specialization of cost equations eval_foo_bb1_in/2 
0.05/0.31	* CE 7 is refined into CE [8] 
0.05/0.31	* CE 3 is refined into CE [9] 
0.05/0.31	* CE 4 is refined into CE [10] 
0.05/0.31	* CE 6 is refined into CE [11] 
0.05/0.31	* CE 5 is refined into CE [12] 
0.05/0.31	
0.05/0.31	
0.05/0.31	### Cost equations --> "Loop" of eval_foo_bb1_in/2 
0.05/0.31	* CEs [9] --> Loop 8 
0.05/0.31	* CEs [10] --> Loop 9 
0.05/0.31	* CEs [11] --> Loop 10 
0.05/0.31	* CEs [12] --> Loop 11 
0.05/0.31	* CEs [8] --> Loop 12 
0.05/0.31	
0.05/0.31	### Ranking functions of CR eval_foo_bb1_in(V__0,B) 
0.05/0.31	
0.05/0.31	#### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 
0.05/0.31	* Partial RF of phase [8,9]:
0.05/0.31	  - RF of loop [8:1]:
0.05/0.31	    -V__0/13-5/13 depends on loops [9:1] 
0.05/0.31	  - RF of loop [9:1]:
0.05/0.31	    V__0/13-5/13 depends on loops [8:1] 
0.05/0.31	
0.05/0.31	
0.05/0.31	### Specialization of cost equations eval_foo_bb0_in/2 
0.05/0.31	* CE 2 is refined into CE [13,14,15,16] 
0.05/0.31	
0.05/0.31	
0.05/0.31	### Cost equations --> "Loop" of eval_foo_bb0_in/2 
0.05/0.31	* CEs [16] --> Loop 13 
0.05/0.31	* CEs [15] --> Loop 14 
0.05/0.31	* CEs [14] --> Loop 15 
0.05/0.31	* CEs [13] --> Loop 16 
0.05/0.31	
0.05/0.31	### Ranking functions of CR eval_foo_bb0_in(V_i,B) 
0.05/0.31	
0.05/0.31	#### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) 
0.05/0.31	
0.05/0.31	
0.05/0.31	### Specialization of cost equations eval_foo_start/3 
0.05/0.31	* CE 1 is refined into CE [17,18,19,20] 
0.05/0.31	
0.05/0.31	
0.05/0.31	### Cost equations --> "Loop" of eval_foo_start/3 
0.05/0.31	* CEs [20] --> Loop 17 
0.05/0.31	* CEs [19] --> Loop 18 
0.05/0.31	* CEs [18] --> Loop 19 
0.05/0.31	* CEs [17] --> Loop 20 
0.05/0.31	
0.05/0.31	### Ranking functions of CR eval_foo_start(V_i,V_w,B) 
0.05/0.31	
0.05/0.31	#### Partial ranking functions of CR eval_foo_start(V_i,V_w,B) 
0.05/0.31	
0.05/0.31	
0.05/0.31	Computing Bounds
0.05/0.31	=====================================
0.05/0.31	
0.05/0.31	#### Cost of chains of eval_foo_bb1_in(V__0,B):
0.05/0.31	* Chain [[8,9]]...: 2*it(8)+0
0.05/0.31	  with precondition: [B=2] 
0.05/0.31	
0.05/0.31	* Chain [12]: 0
0.05/0.31	  with precondition: [V__0=0,B=2] 
0.05/0.31	
0.05/0.31	* Chain [11,12]: 1
0.05/0.31	  with precondition: [B=2,5>=V__0,V__0>=1] 
0.05/0.31	
0.05/0.31	* Chain [10,12]: 1
0.05/0.31	  with precondition: [B=2,0>=V__0+1,V__0+5>=0] 
0.05/0.31	
0.05/0.31	
0.05/0.31	#### Cost of chains of eval_foo_bb0_in(V_i,B):
0.05/0.31	* Chain [16]: 0
0.05/0.31	  with precondition: [V_i=0] 
0.05/0.31	
0.05/0.31	* Chain [15]: 1
0.05/0.31	  with precondition: [5>=V_i,V_i>=1] 
0.05/0.31	
0.05/0.31	* Chain [14]: 1
0.05/0.31	  with precondition: [0>=V_i+1,V_i+5>=0] 
0.05/0.31	
0.05/0.31	* Chain [13]...: 2*s(1)+0
0.05/0.31	  with precondition: [] 
0.05/0.31	
0.05/0.31	
0.05/0.31	#### Cost of chains of eval_foo_start(V_i,V_w,B):
0.05/0.31	* Chain [20]: 0
0.05/0.31	  with precondition: [V_i=0] 
0.05/0.31	
0.05/0.31	* Chain [19]: 1
0.05/0.31	  with precondition: [5>=V_i,V_i>=1] 
0.05/0.31	
0.05/0.31	* Chain [18]: 1
0.05/0.31	  with precondition: [0>=V_i+1,V_i+5>=0] 
0.05/0.31	
0.05/0.31	* Chain [17]...: 2*s(2)+0
0.05/0.31	  with precondition: [] 
0.05/0.31	
0.05/0.31	
0.05/0.31	Closed-form bounds of eval_foo_start(V_i,V_w,B): 
0.05/0.31	-------------------------------------
0.05/0.31	* Chain [20] with precondition: [V_i=0] 
0.05/0.31	    - Upper bound: 0 
0.05/0.31	    - Complexity: constant 
0.05/0.31	* Chain [19] with precondition: [5>=V_i,V_i>=1] 
0.05/0.31	    - Upper bound: 1 
0.05/0.31	    - Complexity: constant 
0.05/0.31	* Chain [18] with precondition: [0>=V_i+1,V_i+5>=0] 
0.05/0.31	    - Upper bound: 1 
0.05/0.31	    - Complexity: constant 
0.05/0.31	* Chain [17]... with precondition: [] 
0.05/0.31	    - Upper bound: inf 
0.05/0.31	    - Complexity: infinity 
0.05/0.31	
0.05/0.31	### Maximum cost of eval_foo_start(V_i,V_w,B): inf 
0.05/0.31	Asymptotic class: infinity 
0.05/0.31	* Total analysis performed in 201 ms.
0.05/0.31	
0.05/0.41	EOF