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