0.03/0.16	MAYBE
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. recursive  : [f2/6]
0.03/0.16	1. non_recursive  : [exit_location/1]
0.03/0.16	2. non_recursive  : [f300/4]
0.03/0.16	3. non_recursive  : [f2_loop_cont/5]
0.03/0.16	4. non_recursive  : [f1/4]
0.03/0.16	
0.03/0.16	#### Obtained direct recursion through partial evaluation 
0.03/0.16	0. SCC is partially evaluated into f2/6
0.03/0.16	1. SCC is completely evaluated into other SCCs
0.03/0.16	2. SCC is completely evaluated into other SCCs
0.03/0.16	3. SCC is partially evaluated into f2_loop_cont/5
0.03/0.16	4. SCC is partially evaluated into f1/4
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 f2/6 
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	* CE 2 is refined into CE [11] 
0.03/0.16	
0.03/0.16	
0.03/0.16	### Cost equations --> "Loop" of f2/6 
0.03/0.16	* CEs [10] --> Loop 8 
0.03/0.16	* CEs [11] --> Loop 9 
0.03/0.16	* CEs [8] --> Loop 10 
0.03/0.16	* CEs [9] --> Loop 11 
0.03/0.16	
0.03/0.16	### Ranking functions of CR f2(A,B,C,E,F,G) 
0.03/0.16	* RF of phase [9]: [-A+B]
0.03/0.16	
0.03/0.16	#### Partial ranking functions of CR f2(A,B,C,E,F,G) 
0.03/0.16	* Partial RF of phase [9]:
0.03/0.16	  - RF of loop [9:1]:
0.03/0.16	    -A+B
0.03/0.16	
0.03/0.16	
0.03/0.16	### Specialization of cost equations f2_loop_cont/5 
0.03/0.16	* CE 7 is refined into CE [12] 
0.03/0.16	* CE 6 is refined into CE [13] 
0.03/0.16	
0.03/0.16	
0.03/0.16	### Cost equations --> "Loop" of f2_loop_cont/5 
0.03/0.16	* CEs [12] --> Loop 12 
0.03/0.16	* CEs [13] --> Loop 13 
0.03/0.16	
0.03/0.16	### Ranking functions of CR f2_loop_cont(A,B,C,D,E) 
0.03/0.16	
0.03/0.16	#### Partial ranking functions of CR f2_loop_cont(A,B,C,D,E) 
0.03/0.16	
0.03/0.16	
0.03/0.16	### Specialization of cost equations f1/4 
0.03/0.16	* CE 1 is refined into CE [14,15,16,17,18,19,20] 
0.03/0.16	
0.03/0.16	
0.03/0.16	### Cost equations --> "Loop" of f1/4 
0.03/0.16	* CEs [19,20] --> Loop 14 
0.03/0.16	* CEs [18] --> Loop 15 
0.03/0.16	* CEs [15,17] --> Loop 16 
0.03/0.16	* CEs [14] --> Loop 17 
0.03/0.16	* CEs [16] --> Loop 18 
0.03/0.16	
0.03/0.16	### Ranking functions of CR f1(A,B,C,E) 
0.03/0.16	
0.03/0.16	#### Partial ranking functions of CR f1(A,B,C,E) 
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 f2(A,B,C,E,F,G):
0.03/0.16	* Chain [[9],11]: 1*it(9)+0
0.03/0.16	  Such that:it(9) =< -A+F
0.03/0.16	
0.03/0.16	  with precondition: [E=2,B=F,B>=A+1] 
0.03/0.16	
0.03/0.16	* Chain [[9],10]: 1*it(9)+0
0.03/0.16	  Such that:it(9) =< -A+B
0.03/0.16	
0.03/0.16	  with precondition: [E=3,B>=A+1] 
0.03/0.16	
0.03/0.16	* Chain [[8]]...: 1*it(8)+0
0.03/0.16	  with precondition: [A>=B+1] 
0.03/0.16	
0.03/0.16	* Chain [[8],10]: 1*it(8)+0
0.03/0.16	  with precondition: [E=3,A>=B+1] 
0.03/0.16	
0.03/0.16	* Chain [11]: 0
0.03/0.16	  with precondition: [E=2,A=B,A=F] 
0.03/0.16	
0.03/0.16	* Chain [10]: 0
0.03/0.16	  with precondition: [E=3] 
0.03/0.16	
0.03/0.16	
0.03/0.16	#### Cost of chains of f2_loop_cont(A,B,C,D,E):
0.03/0.16	* Chain [13]: 0
0.03/0.16	  with precondition: [A=2] 
0.03/0.16	
0.03/0.16	* Chain [12]: 0
0.03/0.16	  with precondition: [A=3] 
0.03/0.16	
0.03/0.16	
0.03/0.16	#### Cost of chains of f1(A,B,C,E):
0.03/0.16	* Chain [18]: 0
0.03/0.16	  with precondition: [] 
0.03/0.16	
0.03/0.16	* Chain [17]: 0
0.03/0.16	  with precondition: [B=A] 
0.03/0.16	
0.03/0.16	* Chain [16]: 2*s(1)+0
0.03/0.16	  Such that:aux(1) =< -A+B
0.03/0.16	s(1) =< aux(1)
0.03/0.16	
0.03/0.16	  with precondition: [B>=A+1] 
0.03/0.16	
0.03/0.16	* Chain [15]: 1*s(3)+0
0.03/0.16	  with precondition: [A>=B+1] 
0.03/0.16	
0.03/0.16	* Chain [14]...: 1*aux(2)+0
0.03/0.16	  with precondition: [A>=B+1] 
0.03/0.16	
0.03/0.16	
0.03/0.16	Closed-form bounds of f1(A,B,C,E): 
0.03/0.16	-------------------------------------
0.03/0.16	* Chain [18] with precondition: [] 
0.03/0.16	    - Upper bound: 0 
0.03/0.16	    - Complexity: constant 
0.03/0.16	* Chain [17] with precondition: [B=A] 
0.03/0.16	    - Upper bound: 0 
0.03/0.16	    - Complexity: constant 
0.03/0.16	* Chain [16] with precondition: [B>=A+1] 
0.03/0.16	    - Upper bound: -2*A+2*B 
0.03/0.16	    - Complexity: n 
0.03/0.16	* Chain [15] with precondition: [A>=B+1] 
0.03/0.16	    - Upper bound: inf 
0.03/0.16	    - Complexity: infinity 
0.03/0.16	* Chain [14]... with precondition: [A>=B+1] 
0.03/0.16	    - Upper bound: inf 
0.03/0.16	    - Complexity: infinity 
0.03/0.16	
0.03/0.16	### Maximum cost of f1(A,B,C,E): inf 
0.03/0.16	Asymptotic class: infinity 
0.03/0.16	* Total analysis performed in 103 ms.
0.03/0.16	
0.03/0.26	EOF