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