0.05/0.16	WORST_CASE(?,O(n^1))  
0.05/0.16	
0.05/0.16	Preprocessing Cost Relations
0.05/0.16	=====================================
0.05/0.16	
0.05/0.16	#### Computed strongly connected components 
0.05/0.16	0. recursive  : [eval_aaron2_0/4,eval_aaron2_1/5,eval_aaron2_bb1_in/4,eval_aaron2_bb2_in/4,eval_aaron2_bb3_in/5,eval_aaron2_bb4_in/5]
0.05/0.16	1. non_recursive  : [eval_aaron2_stop/1]
0.05/0.16	2. non_recursive  : [eval_aaron2_bb5_in/1]
0.05/0.16	3. non_recursive  : [eval_aaron2_bb1_in_loop_cont/2]
0.05/0.16	4. non_recursive  : [eval_aaron2_bb0_in/4]
0.05/0.16	5. non_recursive  : [eval_aaron2_start/4]
0.05/0.16	
0.05/0.16	#### Obtained direct recursion through partial evaluation 
0.05/0.16	0. SCC is partially evaluated into eval_aaron2_bb1_in/4
0.05/0.16	1. SCC is completely evaluated into other SCCs
0.05/0.16	2. SCC is completely evaluated into other SCCs
0.05/0.16	3. SCC is completely evaluated into other SCCs
0.05/0.16	4. SCC is partially evaluated into eval_aaron2_bb0_in/4
0.05/0.16	5. SCC is partially evaluated into eval_aaron2_start/4
0.05/0.16	
0.05/0.16	Control-Flow Refinement of Cost Relations
0.05/0.16	=====================================
0.05/0.16	
0.05/0.16	### Specialization of cost equations eval_aaron2_bb1_in/4 
0.05/0.16	* CE 6 is refined into CE [8] 
0.05/0.16	* CE 7 is discarded (unfeasible) 
0.05/0.16	* CE 5 is refined into CE [9] 
0.05/0.16	* CE 4 is refined into CE [10] 
0.05/0.16	
0.05/0.16	
0.05/0.16	### Cost equations --> "Loop" of eval_aaron2_bb1_in/4 
0.05/0.16	* CEs [9] --> Loop 8 
0.05/0.16	* CEs [10] --> Loop 9 
0.05/0.16	* CEs [8] --> Loop 10 
0.05/0.16	
0.05/0.16	### Ranking functions of CR eval_aaron2_bb1_in(V_tx,V__02,V__01,B) 
0.05/0.16	* RF of phase [8,9]: [-V__02+V__01+1]
0.05/0.16	
0.05/0.16	#### Partial ranking functions of CR eval_aaron2_bb1_in(V_tx,V__02,V__01,B) 
0.05/0.16	* Partial RF of phase [8,9]:
0.05/0.16	  - RF of loop [8:1,9:1]:
0.05/0.16	    -V__02+V__01+1
0.05/0.16	
0.05/0.16	
0.05/0.16	### Specialization of cost equations eval_aaron2_bb0_in/4 
0.05/0.16	* CE 3 is refined into CE [11,12] 
0.05/0.16	* CE 2 is refined into CE [13] 
0.05/0.16	
0.05/0.16	
0.05/0.16	### Cost equations --> "Loop" of eval_aaron2_bb0_in/4 
0.05/0.16	* CEs [11] --> Loop 11 
0.05/0.16	* CEs [12] --> Loop 12 
0.05/0.16	* CEs [13] --> Loop 13 
0.05/0.16	
0.05/0.16	### Ranking functions of CR eval_aaron2_bb0_in(V_tx,V_x,V_y,B) 
0.05/0.16	
0.05/0.16	#### Partial ranking functions of CR eval_aaron2_bb0_in(V_tx,V_x,V_y,B) 
0.05/0.16	
0.05/0.16	
0.05/0.16	### Specialization of cost equations eval_aaron2_start/4 
0.05/0.16	* CE 1 is refined into CE [14,15,16] 
0.05/0.16	
0.05/0.16	
0.05/0.16	### Cost equations --> "Loop" of eval_aaron2_start/4 
0.05/0.16	* CEs [16] --> Loop 14 
0.05/0.16	* CEs [15] --> Loop 15 
0.05/0.16	* CEs [14] --> Loop 16 
0.05/0.16	
0.05/0.16	### Ranking functions of CR eval_aaron2_start(V_tx,V_x,V_y,B) 
0.05/0.16	
0.05/0.16	#### Partial ranking functions of CR eval_aaron2_start(V_tx,V_x,V_y,B) 
0.05/0.16	
0.05/0.16	
0.05/0.16	Computing Bounds
0.05/0.16	=====================================
0.05/0.16	
0.05/0.16	#### Cost of chains of eval_aaron2_bb1_in(V_tx,V__02,V__01,B):
0.05/0.16	* Chain [[8,9],10]: 2*it(8)+0
0.05/0.16	  Such that:aux(2) =< V_tx-V__02+V__01+1
0.05/0.16	aux(1) =< -V__02+V__01+1
0.05/0.16	it(8) =< aux(1)
0.05/0.16	it(8) =< aux(2)
0.05/0.16	
0.05/0.16	  with precondition: [B=2,V_tx>=0,V__01>=V__02] 
0.05/0.16	
0.05/0.16	* Chain [10]: 0
0.05/0.16	  with precondition: [B=2,V_tx>=0,V__02>=V__01+1] 
0.05/0.16	
0.05/0.16	
0.05/0.16	#### Cost of chains of eval_aaron2_bb0_in(V_tx,V_x,V_y,B):
0.05/0.16	* Chain [13]: 0
0.05/0.16	  with precondition: [0>=V_tx+1] 
0.05/0.16	
0.05/0.16	* Chain [12]: 0
0.05/0.16	  with precondition: [V_tx>=0,V_y>=V_x+1] 
0.05/0.16	
0.05/0.16	* Chain [11]: 2*s(3)+0
0.05/0.16	  Such that:s(1) =< V_tx+V_x-V_y+1
0.05/0.16	s(2) =< V_x-V_y+1
0.05/0.16	s(3) =< s(2)
0.05/0.16	s(3) =< s(1)
0.05/0.16	
0.05/0.16	  with precondition: [V_tx>=0,V_x>=V_y] 
0.05/0.16	
0.05/0.16	
0.05/0.16	#### Cost of chains of eval_aaron2_start(V_tx,V_x,V_y,B):
0.05/0.16	* Chain [16]: 0
0.05/0.16	  with precondition: [0>=V_tx+1] 
0.05/0.16	
0.05/0.16	* Chain [15]: 0
0.05/0.16	  with precondition: [V_tx>=0,V_y>=V_x+1] 
0.05/0.16	
0.05/0.16	* Chain [14]: 2*s(6)+0
0.05/0.16	  Such that:s(4) =< V_tx+V_x-V_y+1
0.05/0.16	s(5) =< V_x-V_y+1
0.05/0.16	s(6) =< s(5)
0.05/0.16	s(6) =< s(4)
0.05/0.16	
0.05/0.16	  with precondition: [V_tx>=0,V_x>=V_y] 
0.05/0.16	
0.05/0.16	
0.05/0.16	Closed-form bounds of eval_aaron2_start(V_tx,V_x,V_y,B): 
0.05/0.16	-------------------------------------
0.05/0.16	* Chain [16] with precondition: [0>=V_tx+1] 
0.05/0.16	    - Upper bound: 0 
0.05/0.16	    - Complexity: constant 
0.05/0.16	* Chain [15] with precondition: [V_tx>=0,V_y>=V_x+1] 
0.05/0.16	    - Upper bound: 0 
0.05/0.16	    - Complexity: constant 
0.05/0.16	* Chain [14] with precondition: [V_tx>=0,V_x>=V_y] 
0.05/0.16	    - Upper bound: 2*V_x-2*V_y+2 
0.05/0.16	    - Complexity: n 
0.05/0.16	
0.05/0.16	### Maximum cost of eval_aaron2_start(V_tx,V_x,V_y,B): nat(V_x-V_y+1)*2 
0.05/0.16	Asymptotic class: n 
0.05/0.16	* Total analysis performed in 90 ms.
0.05/0.16	
0.05/0.26	EOF