0.04/0.10	MAYBE
0.04/0.10	WARNING: Excluded non-linear constraints:[B*A>=0+1]
0.04/0.10	WARNING: Excluded non-linear constraints:[B*A=<0]
0.04/0.10	WARNING: Excluded non-linear constraints:[B*C=<0]
0.04/0.10	
0.04/0.10	Preprocessing Cost Relations
0.04/0.10	=====================================
0.04/0.10	
0.04/0.10	#### Computed strongly connected components 
0.04/0.10	0. recursive  : [eval_foo_bb1_in/3,eval_foo_bb2_in/3]
0.04/0.10	1. non_recursive  : [eval_foo_stop/1]
0.04/0.10	2. non_recursive  : [eval_foo_bb3_in/1]
0.04/0.10	3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
0.04/0.10	4. non_recursive  : [eval_foo_bb0_in/3]
0.04/0.10	5. non_recursive  : [eval_foo_start/3]
0.04/0.10	
0.04/0.10	#### Obtained direct recursion through partial evaluation 
0.04/0.10	0. SCC is partially evaluated into eval_foo_bb1_in/3
0.04/0.10	1. SCC is completely evaluated into other SCCs
0.04/0.10	2. SCC is completely evaluated into other SCCs
0.04/0.10	3. SCC is completely evaluated into other SCCs
0.04/0.10	4. SCC is partially evaluated into eval_foo_bb0_in/3
0.04/0.10	5. SCC is partially evaluated into eval_foo_start/3
0.04/0.10	
0.04/0.10	Control-Flow Refinement of Cost Relations
0.04/0.10	=====================================
0.04/0.10	
0.04/0.10	### Specialization of cost equations eval_foo_bb1_in/3 
0.04/0.10	* CE 4 is refined into CE [5] 
0.04/0.10	* CE 3 is refined into CE [6] 
0.04/0.10	
0.04/0.10	
0.04/0.10	### Cost equations --> "Loop" of eval_foo_bb1_in/3 
0.04/0.10	* CEs [6] --> Loop 5 
0.04/0.10	* CEs [5] --> Loop 6 
0.04/0.10	
0.04/0.10	### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
0.04/0.10	
0.04/0.10	#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
0.04/0.10	
0.04/0.10	
0.04/0.10	### Specialization of cost equations eval_foo_bb0_in/3 
0.04/0.10	* CE 2 is refined into CE [7,8] 
0.04/0.10	
0.04/0.10	
0.04/0.10	### Cost equations --> "Loop" of eval_foo_bb0_in/3 
0.04/0.10	* CEs [8] --> Loop 7 
0.04/0.10	* CEs [7] --> Loop 8 
0.04/0.10	
0.04/0.10	### Ranking functions of CR eval_foo_bb0_in(V_i,V_j,B) 
0.04/0.10	
0.04/0.10	#### Partial ranking functions of CR eval_foo_bb0_in(V_i,V_j,B) 
0.04/0.10	
0.04/0.10	
0.04/0.10	### Specialization of cost equations eval_foo_start/3 
0.04/0.10	* CE 1 is refined into CE [9,10] 
0.04/0.10	
0.04/0.10	
0.04/0.10	### Cost equations --> "Loop" of eval_foo_start/3 
0.04/0.10	* CEs [10] --> Loop 9 
0.04/0.10	* CEs [9] --> Loop 10 
0.04/0.10	
0.04/0.10	### Ranking functions of CR eval_foo_start(V_i,V_j,B) 
0.04/0.10	
0.04/0.10	#### Partial ranking functions of CR eval_foo_start(V_i,V_j,B) 
0.04/0.10	
0.04/0.10	
0.04/0.10	Computing Bounds
0.04/0.10	=====================================
0.04/0.10	
0.04/0.10	#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
0.04/0.10	* Chain [[5]]...: 1*it(5)+0
0.04/0.10	  with precondition: [B=2] 
0.04/0.10	
0.04/0.10	* Chain [[5],6]: 1*it(5)+0
0.04/0.10	  with precondition: [B=2] 
0.04/0.10	
0.04/0.10	* Chain [6]: 0
0.04/0.10	  with precondition: [B=2] 
0.04/0.10	
0.04/0.10	
0.04/0.10	#### Cost of chains of eval_foo_bb0_in(V_i,V_j,B):
0.04/0.10	* Chain [8]: 1*s(2)+0
0.04/0.10	  with precondition: [] 
0.04/0.10	
0.04/0.10	* Chain [7]...: 1*s(3)+0
0.04/0.10	  with precondition: [] 
0.04/0.10	
0.04/0.10	
0.04/0.10	#### Cost of chains of eval_foo_start(V_i,V_j,B):
0.04/0.10	* Chain [10]: 1*s(4)+0
0.04/0.10	  with precondition: [] 
0.04/0.10	
0.04/0.10	* Chain [9]...: 1*s(5)+0
0.04/0.10	  with precondition: [] 
0.04/0.10	
0.04/0.10	
0.04/0.10	Closed-form bounds of eval_foo_start(V_i,V_j,B): 
0.04/0.10	-------------------------------------
0.04/0.10	* Chain [10] with precondition: [] 
0.04/0.10	    - Upper bound: inf 
0.04/0.10	    - Complexity: infinity 
0.04/0.10	* Chain [9]... with precondition: [] 
0.04/0.10	    - Upper bound: inf 
0.04/0.10	    - Complexity: infinity 
0.04/0.10	
0.04/0.10	### Maximum cost of eval_foo_start(V_i,V_j,B): inf 
0.04/0.10	Asymptotic class: infinity 
0.04/0.10	* Total analysis performed in 31 ms.
0.04/0.10	
0.04/0.20	EOF