0.04/0.12	WORST_CASE(?,O(n^1))  
0.04/0.12	
0.04/0.12	Preprocessing Cost Relations
0.04/0.12	=====================================
0.04/0.12	
0.04/0.12	#### Computed strongly connected components 
0.04/0.12	0. recursive  : [eval_foo_bb1_in/2]
0.04/0.12	1. non_recursive  : [eval_foo_stop/1]
0.04/0.12	2. non_recursive  : [eval_foo_bb2_in/1]
0.04/0.12	3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
0.04/0.12	4. non_recursive  : [eval_foo_bb0_in/2]
0.04/0.12	5. non_recursive  : [eval_foo_start/3]
0.04/0.12	
0.04/0.12	#### Obtained direct recursion through partial evaluation 
0.04/0.12	0. SCC is partially evaluated into eval_foo_bb1_in/2
0.04/0.12	1. SCC is completely evaluated into other SCCs
0.04/0.12	2. SCC is completely evaluated into other SCCs
0.04/0.12	3. SCC is completely evaluated into other SCCs
0.04/0.12	4. SCC is partially evaluated into eval_foo_bb0_in/2
0.04/0.12	5. SCC is partially evaluated into eval_foo_start/3
0.04/0.12	
0.04/0.12	Control-Flow Refinement of Cost Relations
0.04/0.12	=====================================
0.04/0.12	
0.04/0.12	### Specialization of cost equations eval_foo_bb1_in/2 
0.04/0.12	* CE 4 is refined into CE [5] 
0.04/0.12	* CE 3 is refined into CE [6] 
0.04/0.12	
0.04/0.12	
0.04/0.12	### Cost equations --> "Loop" of eval_foo_bb1_in/2 
0.04/0.12	* CEs [6] --> Loop 5 
0.04/0.12	* CEs [5] --> Loop 6 
0.04/0.12	
0.04/0.12	### Ranking functions of CR eval_foo_bb1_in(V_n_sink,B) 
0.04/0.12	* RF of phase [5]: [V_n_sink-2]
0.04/0.12	
0.04/0.12	#### Partial ranking functions of CR eval_foo_bb1_in(V_n_sink,B) 
0.04/0.12	* Partial RF of phase [5]:
0.04/0.12	  - RF of loop [5:1]:
0.04/0.12	    V_n_sink-2
0.04/0.12	
0.04/0.12	
0.04/0.12	### Specialization of cost equations eval_foo_bb0_in/2 
0.04/0.12	* CE 2 is refined into CE [7,8] 
0.04/0.12	
0.04/0.12	
0.04/0.12	### Cost equations --> "Loop" of eval_foo_bb0_in/2 
0.04/0.12	* CEs [8] --> Loop 7 
0.04/0.12	* CEs [7] --> Loop 8 
0.04/0.12	
0.04/0.12	### Ranking functions of CR eval_foo_bb0_in(V_n,B) 
0.04/0.12	
0.04/0.12	#### Partial ranking functions of CR eval_foo_bb0_in(V_n,B) 
0.04/0.12	
0.04/0.12	
0.04/0.12	### Specialization of cost equations eval_foo_start/3 
0.04/0.12	* CE 1 is refined into CE [9,10] 
0.04/0.12	
0.04/0.12	
0.04/0.12	### Cost equations --> "Loop" of eval_foo_start/3 
0.04/0.12	* CEs [10] --> Loop 9 
0.04/0.12	* CEs [9] --> Loop 10 
0.04/0.12	
0.04/0.12	### Ranking functions of CR eval_foo_start(V_i,V_n,B) 
0.04/0.12	
0.04/0.12	#### Partial ranking functions of CR eval_foo_start(V_i,V_n,B) 
0.04/0.12	
0.04/0.12	
0.04/0.12	Computing Bounds
0.04/0.12	=====================================
0.04/0.12	
0.04/0.12	#### Cost of chains of eval_foo_bb1_in(V_n_sink,B):
0.04/0.12	* Chain [[5],6]: 1*it(5)+0
0.04/0.12	  Such that:it(5) =< V_n_sink
0.04/0.12	
0.04/0.12	  with precondition: [B=2,V_n_sink>=3] 
0.04/0.12	
0.04/0.12	* Chain [6]: 0
0.04/0.12	  with precondition: [B=2,2>=V_n_sink] 
0.04/0.12	
0.04/0.12	
0.04/0.12	#### Cost of chains of eval_foo_bb0_in(V_n,B):
0.04/0.12	* Chain [8]: 0
0.04/0.12	  with precondition: [2>=V_n] 
0.04/0.12	
0.04/0.12	* Chain [7]: 1*s(1)+0
0.04/0.12	  Such that:s(1) =< V_n
0.04/0.12	
0.04/0.12	  with precondition: [V_n>=3] 
0.04/0.12	
0.04/0.12	
0.04/0.12	#### Cost of chains of eval_foo_start(V_i,V_n,B):
0.04/0.12	* Chain [10]: 0
0.04/0.12	  with precondition: [2>=V_n] 
0.04/0.12	
0.04/0.12	* Chain [9]: 1*s(2)+0
0.04/0.12	  Such that:s(2) =< V_n
0.04/0.12	
0.04/0.12	  with precondition: [V_n>=3] 
0.04/0.12	
0.04/0.12	
0.04/0.12	Closed-form bounds of eval_foo_start(V_i,V_n,B): 
0.04/0.12	-------------------------------------
0.04/0.12	* Chain [10] with precondition: [2>=V_n] 
0.04/0.12	    - Upper bound: 0 
0.04/0.12	    - Complexity: constant 
0.04/0.12	* Chain [9] with precondition: [V_n>=3] 
0.04/0.12	    - Upper bound: V_n 
0.04/0.12	    - Complexity: n 
0.04/0.12	
0.04/0.12	### Maximum cost of eval_foo_start(V_i,V_n,B): nat(V_n) 
0.04/0.12	Asymptotic class: n 
0.04/0.12	* Total analysis performed in 31 ms.
0.04/0.12	
0.04/0.22	EOF