0.05/0.13	MAYBE
0.05/0.13	
0.05/0.13	Preprocessing Cost Relations
0.05/0.13	=====================================
0.05/0.13	
0.05/0.13	#### Computed strongly connected components 
0.05/0.13	0. recursive  : [eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3,eval_foo_bb4_in/3]
0.05/0.13	1. non_recursive  : [eval_foo_stop/1]
0.05/0.13	2. non_recursive  : [eval_foo_bb5_in/1]
0.05/0.13	3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
0.05/0.13	4. non_recursive  : [eval_foo_bb0_in/1]
0.05/0.13	5. non_recursive  : [eval_foo_start/3]
0.05/0.13	
0.05/0.13	#### Obtained direct recursion through partial evaluation 
0.05/0.13	0. SCC is partially evaluated into eval_foo_bb1_in/3
0.05/0.13	1. SCC is completely evaluated into other SCCs
0.05/0.13	2. SCC is completely evaluated into other SCCs
0.05/0.13	3. SCC is completely evaluated into other SCCs
0.05/0.13	4. SCC is partially evaluated into eval_foo_bb0_in/1
0.05/0.13	5. SCC is partially evaluated into eval_foo_start/3
0.05/0.13	
0.05/0.13	Control-Flow Refinement of Cost Relations
0.05/0.13	=====================================
0.05/0.13	
0.05/0.13	### Specialization of cost equations eval_foo_bb1_in/3 
0.05/0.13	* CE 5 is refined into CE [6] 
0.05/0.13	* CE 3 is refined into CE [7] 
0.05/0.13	* CE 4 is refined into CE [8] 
0.05/0.13	
0.05/0.13	
0.05/0.13	### Cost equations --> "Loop" of eval_foo_bb1_in/3 
0.05/0.13	* CEs [8] --> Loop 6 
0.05/0.13	* CEs [7] --> Loop 7 
0.05/0.13	* CEs [6] --> Loop 8 
0.05/0.13	
0.05/0.13	### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
0.05/0.13	
0.05/0.13	#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
0.05/0.13	* Partial RF of phase [6,7]:
0.05/0.13	  - RF of loop [6:1]:
0.05/0.13	    V__0-48 depends on loops [7:1] 
0.05/0.13	    -V__01+52 depends on loops [7:1] 
0.05/0.13	  - RF of loop [7:1]:
0.05/0.13	    -V__0+49 depends on loops [6:1] 
0.05/0.13	    V__01-51 depends on loops [6:1] 
0.05/0.13	
0.05/0.13	Warning: no base case found for predicate
0.05/0.13	
0.05/0.13	### Specialization of cost equations eval_foo_bb0_in/1 
0.05/0.13	* CE 2 is refined into CE [9] 
0.05/0.13	
0.05/0.13	
0.05/0.13	### Cost equations --> "Loop" of eval_foo_bb0_in/1 
0.05/0.13	* CEs [9] --> Loop 9 
0.05/0.13	
0.05/0.13	### Ranking functions of CR eval_foo_bb0_in(B) 
0.05/0.13	
0.05/0.13	#### Partial ranking functions of CR eval_foo_bb0_in(B) 
0.05/0.13	
0.05/0.13	Warning: no base case found for predicate
0.05/0.13	
0.05/0.13	### Specialization of cost equations eval_foo_start/3 
0.05/0.13	* CE 1 is refined into CE [10] 
0.05/0.13	
0.05/0.13	
0.05/0.13	### Cost equations --> "Loop" of eval_foo_start/3 
0.05/0.13	* CEs [10] --> Loop 10 
0.05/0.13	
0.05/0.13	### Ranking functions of CR eval_foo_start(V_i,V_j,B) 
0.05/0.13	
0.05/0.13	#### Partial ranking functions of CR eval_foo_start(V_i,V_j,B) 
0.05/0.13	
0.05/0.13	Warning: no base case found for predicate
0.05/0.13	
0.05/0.13	Computing Bounds
0.05/0.13	=====================================
0.05/0.13	
0.05/0.13	#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
0.05/0.13	* Chain [[6,7]]...: 2*it(6)+0
0.05/0.13	  with precondition: [99>=2*V__0,V__0>=0,V__0+V__01=100,B=2] 
0.05/0.13	
0.05/0.13	
0.05/0.13	#### Cost of chains of eval_foo_bb0_in(B):
0.05/0.13	* Chain [9]...: 2*s(1)+0
0.05/0.13	  with precondition: [] 
0.05/0.13	
0.05/0.13	
0.05/0.13	#### Cost of chains of eval_foo_start(V_i,V_j,B):
0.05/0.13	* Chain [10]...: 2*s(2)+0
0.05/0.13	  with precondition: [] 
0.05/0.13	
0.05/0.13	
0.05/0.13	Closed-form bounds of eval_foo_start(V_i,V_j,B): 
0.05/0.13	-------------------------------------
0.05/0.13	* Chain [10]... with precondition: [] 
0.05/0.13	    - Upper bound: inf 
0.05/0.13	    - Complexity: infinity 
0.05/0.13	
0.05/0.13	### Maximum cost of eval_foo_start(V_i,V_j,B): inf 
0.05/0.13	Asymptotic class: infinity 
0.05/0.13	* Total analysis performed in 59 ms.
0.05/0.13	
0.05/0.23	EOF