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