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