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