0.03/0.13	WORST_CASE(?,O(1))  
0.03/0.13	
0.03/0.13	Preprocessing Cost Relations
0.03/0.13	=====================================
0.03/0.13	
0.03/0.13	#### Computed strongly connected components 
0.03/0.13	0. non_recursive  : [f5/4]
0.03/0.13	1. recursive  : [f7/5]
0.03/0.13	2. non_recursive  : [exit_location/1]
0.03/0.13	3. non_recursive  : [f7_loop_cont/5]
0.03/0.13	4. non_recursive  : [f0/4]
0.03/0.13	
0.03/0.13	#### Obtained direct recursion through partial evaluation 
0.03/0.13	0. SCC is completely evaluated into other SCCs
0.03/0.13	1. SCC is partially evaluated into f7/5
0.03/0.13	2. SCC is completely evaluated into other SCCs
0.03/0.13	3. SCC is partially evaluated into f7_loop_cont/5
0.03/0.13	4. SCC is partially evaluated into f0/4
0.03/0.13	
0.03/0.13	Control-Flow Refinement of Cost Relations
0.03/0.13	=====================================
0.03/0.13	
0.03/0.13	### Specialization of cost equations f7/5 
0.03/0.13	* CE 5 is refined into CE [8] 
0.03/0.13	* CE 4 is refined into CE [9] 
0.03/0.13	* CE 3 is refined into CE [10] 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Cost equations --> "Loop" of f7/5 
0.03/0.13	* CEs [10] --> Loop 8 
0.03/0.13	* CEs [8] --> Loop 9 
0.03/0.13	* CEs [9] --> Loop 10 
0.03/0.13	
0.03/0.13	### Ranking functions of CR f7(B,C,E,F,G) 
0.03/0.13	* RF of phase [8]: [-B+36]
0.03/0.13	
0.03/0.13	#### Partial ranking functions of CR f7(B,C,E,F,G) 
0.03/0.13	* Partial RF of phase [8]:
0.03/0.13	  - RF of loop [8:1]:
0.03/0.13	    -B+36
0.03/0.13	
0.03/0.13	
0.03/0.13	### Specialization of cost equations f7_loop_cont/5 
0.03/0.13	* CE 7 is refined into CE [11] 
0.03/0.13	* CE 6 is refined into CE [12] 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Cost equations --> "Loop" of f7_loop_cont/5 
0.03/0.13	* CEs [11] --> Loop 11 
0.03/0.13	* CEs [12] --> Loop 12 
0.03/0.13	
0.03/0.13	### Ranking functions of CR f7_loop_cont(A,B,C,D,E) 
0.03/0.13	
0.03/0.13	#### Partial ranking functions of CR f7_loop_cont(A,B,C,D,E) 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Specialization of cost equations f0/4 
0.03/0.13	* CE 1 is refined into CE [13] 
0.03/0.13	* CE 2 is refined into CE [14,15,16] 
0.03/0.13	
0.03/0.13	
0.03/0.13	### Cost equations --> "Loop" of f0/4 
0.03/0.13	* CEs [13] --> Loop 13 
0.03/0.13	* CEs [14,15,16] --> Loop 14 
0.03/0.13	
0.03/0.13	### Ranking functions of CR f0(A,B,C,E) 
0.03/0.13	
0.03/0.13	#### Partial ranking functions of CR f0(A,B,C,E) 
0.03/0.13	
0.03/0.13	
0.03/0.13	Computing Bounds
0.03/0.13	=====================================
0.03/0.13	
0.03/0.13	#### Cost of chains of f7(B,C,E,F,G):
0.03/0.13	* Chain [[8],10]: 1*it(8)+0
0.03/0.13	  Such that:it(8) =< -B+36
0.03/0.13	
0.03/0.13	  with precondition: [E=2,F=36,B+G=C+36,35>=B,B>=0] 
0.03/0.13	
0.03/0.13	* Chain [[8],9]: 1*it(8)+0
0.03/0.13	  Such that:it(8) =< -B+36
0.03/0.13	
0.03/0.13	  with precondition: [E=3,35>=B,B>=0] 
0.03/0.13	
0.03/0.13	* Chain [9]: 0
0.03/0.13	  with precondition: [E=3,B>=0] 
0.03/0.13	
0.03/0.13	
0.03/0.13	#### Cost of chains of f7_loop_cont(A,B,C,D,E):
0.03/0.13	* Chain [12]: 0
0.03/0.13	  with precondition: [A=2,127>=B] 
0.03/0.13	
0.03/0.13	* Chain [11]: 0
0.03/0.13	  with precondition: [A=3,127>=B] 
0.03/0.13	
0.03/0.13	
0.03/0.13	#### Cost of chains of f0(A,B,C,E):
0.03/0.13	* Chain [14]: 72
0.03/0.13	  with precondition: [127>=A] 
0.03/0.13	
0.03/0.13	* Chain [13]: 0
0.03/0.13	  with precondition: [A>=128] 
0.03/0.13	
0.03/0.13	
0.03/0.13	Closed-form bounds of f0(A,B,C,E): 
0.03/0.13	-------------------------------------
0.03/0.13	* Chain [14] with precondition: [127>=A] 
0.03/0.13	    - Upper bound: 72 
0.03/0.13	    - Complexity: constant 
0.03/0.13	* Chain [13] with precondition: [A>=128] 
0.03/0.13	    - Upper bound: 0 
0.03/0.13	    - Complexity: constant 
0.03/0.13	
0.03/0.13	### Maximum cost of f0(A,B,C,E): 72 
0.03/0.13	Asymptotic class: constant 
0.03/0.13	* Total analysis performed in 68 ms.
0.03/0.13	
0.03/0.23	EOF