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