0.03/0.28	MAYBE
0.03/0.28	
0.03/0.28	Preprocessing Cost Relations
0.03/0.28	=====================================
0.03/0.28	
0.03/0.28	#### Computed strongly connected components 
0.03/0.28	0. recursive  : [f11/9]
0.03/0.28	1. non_recursive  : [exit_location/1]
0.03/0.28	2. recursive  : [f21/1]
0.03/0.28	3. non_recursive  : [f21_loop_cont/2]
0.03/0.28	4. non_recursive  : [f11_loop_cont/8]
0.03/0.28	5. non_recursive  : [f0/7]
0.03/0.28	
0.03/0.28	#### Obtained direct recursion through partial evaluation 
0.03/0.28	0. SCC is partially evaluated into f11/9
0.03/0.28	1. SCC is completely evaluated into other SCCs
0.03/0.28	2. SCC is partially evaluated into f21/1
0.03/0.28	3. SCC is completely evaluated into other SCCs
0.03/0.28	4. SCC is partially evaluated into f11_loop_cont/8
0.03/0.28	5. SCC is partially evaluated into f0/7
0.03/0.28	
0.03/0.28	Control-Flow Refinement of Cost Relations
0.03/0.28	=====================================
0.03/0.28	
0.03/0.28	### Specialization of cost equations f11/9 
0.03/0.28	* CE 4 is refined into CE [10] 
0.03/0.28	* CE 5 is refined into CE [11] 
0.03/0.28	* CE 2 is refined into CE [12] 
0.03/0.28	* CE 3 is refined into CE [13] 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Cost equations --> "Loop" of f11/9 
0.03/0.28	* CEs [12] --> Loop 10 
0.03/0.28	* CEs [13] --> Loop 11 
0.03/0.28	* CEs [10] --> Loop 12 
0.03/0.28	* CEs [11] --> Loop 13 
0.03/0.28	
0.03/0.28	### Ranking functions of CR f11(A,B,C,D,H,I,J,K,L) 
0.03/0.28	* RF of phase [10,11]: [A]
0.03/0.28	
0.03/0.28	#### Partial ranking functions of CR f11(A,B,C,D,H,I,J,K,L) 
0.03/0.28	* Partial RF of phase [10,11]:
0.03/0.28	  - RF of loop [10:1]:
0.03/0.28	    B+3
0.03/0.28	    -C+4
0.03/0.28	  - RF of loop [10:1,11:1]:
0.03/0.28	    A
0.03/0.28	  - RF of loop [11:1]:
0.03/0.28	    A-B
0.03/0.28	    A+C-1
0.03/0.28	
0.03/0.28	
0.03/0.28	### Specialization of cost equations f21/1 
0.03/0.28	* CE 9 is refined into CE [14] 
0.03/0.28	* CE 8 is refined into CE [15] 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Cost equations --> "Loop" of f21/1 
0.03/0.28	* CEs [15] --> Loop 14 
0.03/0.28	* CEs [14] --> Loop 15 
0.03/0.28	
0.03/0.28	### Ranking functions of CR f21(H) 
0.03/0.28	
0.03/0.28	#### Partial ranking functions of CR f21(H) 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Specialization of cost equations f11_loop_cont/8 
0.03/0.28	* CE 7 is refined into CE [16,17] 
0.03/0.28	* CE 6 is refined into CE [18] 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Cost equations --> "Loop" of f11_loop_cont/8 
0.03/0.28	* CEs [16] --> Loop 16 
0.03/0.28	* CEs [18] --> Loop 17 
0.03/0.28	* CEs [17] --> Loop 18 
0.03/0.28	
0.03/0.28	### Ranking functions of CR f11_loop_cont(A,B,C,D,E,F,G,H) 
0.03/0.28	
0.03/0.28	#### Partial ranking functions of CR f11_loop_cont(A,B,C,D,E,F,G,H) 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Specialization of cost equations f0/7 
0.03/0.28	* CE 1 is refined into CE [19,20,21,22] 
0.03/0.28	
0.03/0.28	
0.03/0.28	### Cost equations --> "Loop" of f0/7 
0.03/0.28	* CEs [22] --> Loop 19 
0.03/0.28	* CEs [19,20,21] --> Loop 20 
0.03/0.28	
0.03/0.28	### Ranking functions of CR f0(A,B,C,D,E,F,H) 
0.03/0.28	
0.03/0.28	#### Partial ranking functions of CR f0(A,B,C,D,E,F,H) 
0.03/0.28	
0.03/0.28	
0.03/0.28	Computing Bounds
0.03/0.28	=====================================
0.03/0.28	
0.03/0.28	#### Cost of chains of f11(A,B,C,D,H,I,J,K,L):
0.03/0.28	* Chain [[10,11],13]: 1*it(10)+1*it(11)+0
0.03/0.28	  Such that:it(11) =< A-B
0.03/0.28	it(11) =< A+C
0.03/0.28	aux(3) =< A
0.03/0.28	it(10) =< aux(3)
0.03/0.28	it(11) =< aux(3)
0.03/0.28	
0.03/0.28	  with precondition: [H=2,A>=1,C>=0,4>=A+C,B+C>=1] 
0.03/0.28	
0.03/0.28	* Chain [[10,11],12]: 1*it(10)+1*it(11)+0
0.03/0.28	  Such that:it(11) =< A-B
0.03/0.28	it(11) =< A-B+J
0.03/0.28	it(10) =< B-J
0.03/0.28	aux(4) =< A
0.03/0.28	it(10) =< aux(4)
0.03/0.28	it(11) =< aux(4)
0.03/0.28	
0.03/0.28	  with precondition: [H=3,I=0,B+C=J+K,A>=1,C>=0,4>=A+C,B>=J,B+C>=1,A+J>=B,B+C>=J+1] 
0.03/0.28	
0.03/0.28	* Chain [13]: 0
0.03/0.28	  with precondition: [H=2,C>=0,4>=A+C,B+C>=1] 
0.03/0.28	
0.03/0.28	
0.03/0.28	#### Cost of chains of f21(H):
0.03/0.28	* Chain [[14]]...: 1*it(14)+0
0.03/0.28	  with precondition: [H=2] 
0.03/0.28	
0.03/0.28	* Chain [[14],15]: 1*it(14)+0
0.03/0.28	  with precondition: [H=2] 
0.03/0.28	
0.03/0.28	* Chain [15]: 0
0.03/0.28	  with precondition: [H=2] 
0.03/0.28	
0.03/0.28	
0.03/0.28	#### Cost of chains of f11_loop_cont(A,B,C,D,E,F,G,H):
0.03/0.28	* Chain [18]...: 1*s(2)+0
0.03/0.28	  with precondition: [A=3,G=4,F>=1] 
0.03/0.28	
0.03/0.28	* Chain [17]: 0
0.03/0.28	  with precondition: [A=2,G=4,F>=1] 
0.03/0.28	
0.03/0.28	* Chain [16]: 1*s(3)+0
0.03/0.28	  with precondition: [A=3,G=4,F>=1] 
0.03/0.28	
0.03/0.28	
0.03/0.28	#### Cost of chains of f0(A,B,C,D,E,F,H):
0.03/0.28	* Chain [20]: 1*aux(10)+0
0.03/0.28	  with precondition: [] 
0.03/0.28	
0.03/0.28	* Chain [19]...: 1*s(11)+1*s(12)+1*s(14)+0
0.03/0.28	  Such that:s(11) =< 3
0.03/0.28	aux(11) =< 4
0.03/0.28	s(11) =< aux(11)
0.03/0.28	s(12) =< aux(11)
0.03/0.28	
0.03/0.28	  with precondition: [] 
0.03/0.28	
0.03/0.28	
0.03/0.28	Closed-form bounds of f0(A,B,C,D,E,F,H): 
0.03/0.28	-------------------------------------
0.03/0.28	* Chain [20] with precondition: [] 
0.03/0.28	    - Upper bound: inf 
0.03/0.28	    - Complexity: infinity 
0.03/0.28	* Chain [19]... with precondition: [] 
0.03/0.28	    - Upper bound: inf 
0.03/0.28	    - Complexity: infinity 
0.03/0.28	
0.03/0.28	### Maximum cost of f0(A,B,C,D,E,F,H): inf 
0.03/0.28	Asymptotic class: infinity 
0.03/0.28	* Total analysis performed in 217 ms.
0.03/0.28	
0.03/0.39	EOF