60.17/27.33	NO
60.17/27.33	
60.17/27.33	Solver Timeout: 4
60.17/27.33	Global Timeout: 300
60.17/27.33	Maximum number of concurrent processes: 900
60.17/27.33	*******************************************************************************************
60.17/27.33	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
60.17/27.33	*******************************************************************************************
60.17/27.33	
60.17/27.33	
60.17/27.33	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
60.17/27.33	
60.17/27.33	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
60.17/27.33	+                                                                  +
60.17/27.33	Init Location: 0
60.17/27.33	Transitions:
60.17/27.33	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> main_i}>
60.17/27.33	<l1, l2, true>
60.17/27.33	<l2, l34, not((main_i > 0))>
60.17/27.33	<l2, l3, (main_i > 0)>
60.17/27.33	<l3, l4, (main_i >= main_j)>
60.17/27.33	<l3, l16, not((main_i >= main_j))>
60.17/27.33	<l4, l5, true, seq{main_i -> (main_i + 1)}>
60.17/27.33	<l5, l6, (main_j < 5)>
60.17/27.33	<l5, l13, not((main_j < 5))>
60.17/27.33	<l6, l7, true, seq{main_j -> (main_j + 1)}>
60.17/27.33	<l7, l8, ((main_i - main_j) > 2)>
60.17/27.33	<l7, l10, not(((main_i - main_j) > 2))>
60.17/27.33	<l8, l9, true, seq{main_i -> (main_i + 1)}>
60.17/27.33	<l9, l12, true>
60.17/27.33	<l10, l11, true, seq{main_j -> (main_j + 1)}>
60.17/27.33	<l11, l12, true>
60.17/27.33	<l12, l15, true>
60.17/27.33	<l13, l14, true, seq{main_j -> (main_j - 1)}>
60.17/27.33	<l14, l15, true>
60.17/27.33	<l15, l33, true>
60.17/27.33	<l16, l25, not((main_i > 0))>
60.17/27.33	<l16, l17, (main_i > 0)>
60.17/27.33	<l17, l18, (main_j < 0)>
60.17/27.33	<l17, l25, not((main_j < 0))>
60.17/27.33	<l18, l19, true, seq{main_i -> (main_i - 1)}>
60.17/27.33	<l19, l20, (main_j < ~(1))>
60.17/27.33	<l19, l22, not((main_j < ~(1)))>
60.17/27.33	<l20, l21, true, seq{main_j -> (main_j + 1)}>
60.17/27.33	<l21, l24, true>
60.17/27.33	<l22, l23, true, seq{main_i -> (main_i + 1)}>
60.17/27.33	<l23, l24, true>
60.17/27.33	<l24, l32, true>
60.17/27.33	<l25, l26, true, seq{main_i -> (main_i + 1)}>
60.17/27.33	<l26, l27, ((main_j * 2) > main_i)>
60.17/27.33	<l26, l29, not(((main_j * 2) > main_i))>
60.17/27.33	<l27, l28, true, seq{main_j -> (main_j - 1)}>
60.17/27.33	<l28, l31, true>
60.17/27.33	<l29, l30, true, seq{main_j -> (main_j + 1)}>
60.17/27.33	<l30, l31, true>
60.17/27.33	<l31, l32, true>
60.17/27.33	<l32, l33, true>
60.17/27.33	<l33, l2, true>
60.17/27.33	<l34, l35, true, seq{main__func_return_ -> 0}>
60.17/27.33	
60.17/27.33	Fresh variables:
60.17/27.33	
60.17/27.33	Undef variables:
60.17/27.33	
60.17/27.33	Abstraction variables:
60.17/27.33	
60.17/27.33	Exit nodes:
60.17/27.33	
60.17/27.33	Accepting locations:
60.17/27.33	
60.17/27.33	Asserts:
60.17/27.33	
60.17/27.33	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
60.17/27.33	       
60.17/27.33	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
60.17/27.33	       
60.17/27.33	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
60.17/27.33	
60.17/27.33	Init Location: 0
60.17/27.33	Transitions:
60.17/27.33	<l0, l36, true, seq{main__func_return_ -> 0}>
60.17/27.33	<l36, l37, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
60.17/27.33	<l37, l1, true, seq{main_i -> varCall_1, main_j -> main_i}>
60.17/27.33	<l1, l2, true>
60.17/27.33	<l2, l3, (main_i > 0)>
60.17/27.33	<l2, l34, not((main_i > 0))>
60.17/27.33	<l3, l4, (main_i >= main_j)>
60.17/27.33	<l3, l16, not((main_i >= main_j))>
60.17/27.33	<l4, l5, true, seq{main_i -> (main_i + 1)}>
60.17/27.33	<l5, l6, (main_j < 5)>
60.17/27.33	<l5, l13, not((main_j < 5))>
60.17/27.33	<l6, l7, true, seq{main_j -> (main_j + 1)}>
60.17/27.33	<l7, l8, ((main_i - main_j) > 2)>
60.17/27.33	<l7, l10, not(((main_i - main_j) > 2))>
60.17/27.33	<l8, l9, true, seq{main_i -> (main_i + 1)}>
60.17/27.33	<l9, l12, true>
60.17/27.33	<l10, l11, true, seq{main_j -> (main_j + 1)}>
60.17/27.33	<l11, l12, true>
60.17/27.33	<l12, l15, true>
60.17/27.33	<l13, l14, true, seq{main_j -> (main_j - 1)}>
60.17/27.33	<l14, l15, true>
60.17/27.33	<l15, l33, true>
60.17/27.33	<l16, l17, (main_i > 0)>
60.17/27.33	<l16, l25, not((main_i > 0))>
60.17/27.33	<l17, l18, (main_j < 0)>
60.17/27.33	<l17, l25, not((main_j < 0))>
60.17/27.33	<l18, l19, true, seq{main_i -> (main_i - 1)}>
60.17/27.33	<l19, l20, (main_j < ~(1))>
60.17/27.33	<l19, l22, not((main_j < ~(1)))>
60.17/27.33	<l20, l21, true, seq{main_j -> (main_j + 1)}>
60.17/27.33	<l21, l24, true>
60.17/27.33	<l22, l23, true, seq{main_i -> (main_i + 1)}>
60.17/27.33	<l23, l24, true>
60.17/27.33	<l24, l32, true>
60.17/27.33	<l25, l26, true, seq{main_i -> (main_i + 1)}>
60.17/27.33	<l26, l27, ((main_j * 2) > main_i)>
60.17/27.33	<l26, l29, not(((main_j * 2) > main_i))>
60.17/27.33	<l27, l28, true, seq{main_j -> (main_j - 1)}>
60.17/27.33	<l28, l31, true>
60.17/27.33	<l29, l30, true, seq{main_j -> (main_j + 1)}>
60.17/27.33	<l30, l31, true>
60.17/27.33	<l31, l32, true>
60.17/27.33	<l32, l33, true>
60.17/27.33	<l33, l2, true>
60.17/27.33	<l34, l35, true, seq{main__func_return_ -> 0}>
60.17/27.33	
60.17/27.33	Fresh variables:
60.17/27.33	
60.17/27.33	Undef variables:
60.17/27.33	
60.17/27.33	Abstraction variables:
60.17/27.33	
60.17/27.33	Exit nodes:
60.17/27.33	35, 
60.17/27.33	Accepting locations:
60.17/27.33	
60.17/27.33	Asserts:
60.17/27.33	
60.17/27.33	+                                                                  +
60.17/27.33	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
60.17/27.33	
60.17/27.33	
60.17/27.33	Function Return and Parameters Information [2 functions]:
60.17/27.33	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
60.17/27.33	        __VERIFIER_nondet_int__func_return_      [function result] : int
60.17/27.33	    function name: main [1 return + 0 parameters]        demangled: main
60.17/27.33	        main__func_return_      [function result] : int
60.17/27.33	
60.17/27.33	
60.17/27.33	AST Ident Scanner Information [4 idents]:
60.17/27.33	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 8, col: 9>
60.17/27.33	main | function | [integer, ()] | <line: 5, col: 1>
60.17/27.33	i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 9, col: 9> <line: 11, col: 12> <line: 12, col: 13> <line: 13, col: 13> <line: 13, col: 17> <line: 16, col: 21> <line: 17, col: 21> <line: 17, col: 25> <line: 25, col: 17> <line: 26, col: 17> <line: 26, col: 21> <line: 30, col: 21> <line: 30, col: 25> <line: 33, col: 17> <line: 33, col: 21> <line: 34, col: 27>
60.17/27.33	j | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 12, col: 18> <line: 14, col: 17> <line: 15, col: 17> <line: 15, col: 21> <line: 16, col: 23> <line: 19, col: 21> <line: 19, col: 25> <line: 22, col: 17> <line: 22, col: 21> <line: 25, col: 26> <line: 27, col: 21> <line: 28, col: 21> <line: 28, col: 25> <line: 34, col: 21> <line: 35, col: 21> <line: 35, col: 25> <line: 37, col: 21> <line: 37, col: 25>
60.17/27.33	
60.17/27.33	Main function: main
60.17/27.33	Preprocessed LLVMGraph
60.17/27.33	Init Location: 0
60.17/27.33	Transitions:
60.17/27.33	<l0, l2, (main_i = undef2) /\ (main_j = undef2)>
60.17/27.33	<l2, l2, (main_i > 0) /\ (main_i >= main_j) /\ (main_j < 5) /\ (((main_i + 1) - (main_j + 1)) > 2), par{main_i -> ((main_i + 1) + 1), main_j -> (main_j + 1)}>
60.17/27.33	<l2, l2, (main_i > 0) /\ (main_i >= main_j) /\ (main_j < 5) /\ not((((main_i + 1) - (main_j + 1)) > 2)), par{main_i -> (main_i + 1), main_j -> ((main_j + 1) + 1)}>
60.17/27.33	<l2, l2, (main_i > 0) /\ (main_i >= main_j) /\ not((main_j < 5)), par{main_i -> (main_i + 1), main_j -> (main_j - 1)}>
60.17/27.33	<l2, l2, (main_i > 0) /\ not((main_i >= main_j)) /\ (main_i > 0) /\ not((main_j < 0)) /\ ((main_j * 2) > (main_i + 1)), par{main_i -> (main_i + 1), main_j -> (main_j - 1)}>
60.17/27.33	<l2, l35, not((main_i > 0))>
60.17/27.33	
60.17/27.33	Fresh variables:
60.17/27.33	undef2, 
60.17/27.33	
60.17/27.33	Undef variables:
60.17/27.33	undef2, 
60.17/27.33	
60.17/27.33	Abstraction variables:
60.17/27.33	
60.17/27.33	Exit nodes:
60.17/27.33	35, 
60.17/27.33	Accepting locations:
60.17/27.33	
60.17/27.33	Asserts:
60.17/27.33	
60.17/27.33	*************************************************************
60.17/27.33	*******************************************************************************************
60.17/27.33	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
60.17/27.33	*******************************************************************************************
60.17/27.33	
60.17/27.33	Init Location: 0
60.17/27.33	Graph 0:
60.17/27.33	Transitions:
60.17/27.33	Variables:
60.17/27.33	
60.17/27.33	Graph 1:
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	
60.17/27.33	Graph 2:
60.17/27.33	Transitions:
60.17/27.33	Variables:
60.17/27.33	
60.17/27.33	Precedence: 
60.17/27.33	Graph 0
60.17/27.33	
60.17/27.33	Graph 1
60.17/27.33	<l0, l2, main_i = undef2 /\ main_j = undef2, {all remain the same}>
60.17/27.33	
60.17/27.33	Graph 2
60.17/27.33	<l2, l35, main_i <= 0, {all remain the same}>
60.17/27.33	
60.17/27.33	Map Locations to Subgraph:
60.17/27.33	( 0 , 0 )
60.17/27.33	( 2 , 1 )
60.17/27.33	( 35 , 2 )
60.17/27.33	
60.17/27.33	*******************************************************************************************
60.17/27.33	********************************    CHECKING ASSERTIONS    ********************************
60.17/27.33	*******************************************************************************************
60.17/27.33	
60.17/27.33	Proving termination of subgraph 0
60.17/27.33	Proving termination of subgraph 1
60.17/27.33	Checking unfeasibility...
60.17/27.33	Time used: 0.101643
60.17/27.33	
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.003514s
60.17/27.33	Ranking function: 5 + (~(1) / 2)*main_i + (~(1) / 2)*main_j
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001920s
60.17/27.33	Ranking function: -main_i + main_j
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001055s
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.029466s
60.17/27.33	[32903 : 32905]
60.17/27.33	[32903 : 32906]
60.17/27.33	Successful child: 32905
60.17/27.33	[ Invariant Graph ]
60.17/27.33	Strengthening and disabling transitions...
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	[ Termination Graph ]
60.17/27.33	Strengthening and disabling transitions...
60.17/27.33	> It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	New Graphs: 
60.17/27.33	
60.17/27.33	LOG: CALL check - Post:1 + main_i <= 0 - Process 1
60.17/27.33	* Exit transition: <l0, l2, main_i = undef2 /\ main_j = undef2, {all remain the same}>
60.17/27.33	* Postcondition  : 1 + main_i <= 0
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.000625s
60.17/27.33	> Postcondition is not implied!
60.17/27.33	
60.17/27.33	LOG: RETURN check - Elapsed time: 0.000716s
60.17/27.33	INVARIANTS: 
60.17/27.33	2: 
60.17/27.33	Quasi-INVARIANTS to narrow Graph: 
60.17/27.33	2: 1 + main_i <= 0 , 
60.17/27.33	Narrowing transition: 
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: Narrow transition size 1
60.17/27.33	Narrowing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: Narrow transition size 1
60.17/27.33	Narrowing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: Narrow transition size 1
60.17/27.33	Narrowing transition: 
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: Narrow transition size 1
60.17/27.33	invGraph after Narrowing: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.002871s
60.17/27.33	Ranking function: 5 + (~(1) / 2)*main_i + (~(1) / 2)*main_j
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.002030s
60.17/27.33	Ranking function: -main_i + main_j
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001075s
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.029839s
60.17/27.33	[32903 : 32911]
60.17/27.33	[32903 : 32912]
60.17/27.33	Successful child: 32911
60.17/27.33	[ Invariant Graph ]
60.17/27.33	Strengthening and disabling transitions...
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	[ Termination Graph ]
60.17/27.33	Strengthening and disabling transitions...
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	It's unfeasible. Removing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	New Graphs: 
60.17/27.33	
60.17/27.33	LOG: CALL check - Post:main_j <= 0 - Process 2
60.17/27.33	* Exit transition: <l0, l2, 0 <= main_i /\ main_i = undef2 /\ main_j = undef2, {all remain the same}>
60.17/27.33	* Postcondition  : main_j <= 0
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.000613s
60.17/27.33	> Postcondition is not implied!
60.17/27.33	
60.17/27.33	LOG: RETURN check - Elapsed time: 0.000708s
60.17/27.33	INVARIANTS: 
60.17/27.33	2: 
60.17/27.33	Quasi-INVARIANTS to narrow Graph: 
60.17/27.33	2: main_i <= main_j , main_j <= main_i , main_j <= 0 , 
60.17/27.33	Narrowing transition: 
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: Narrow transition size 3
60.17/27.33	Narrowing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: Narrow transition size 3
60.17/27.33	Narrowing transition: 
60.17/27.33	<l2, l2, main_j <= main_i /\ 1 <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: Narrow transition size 3
60.17/27.33	Narrowing transition: 
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: Narrow transition size 3
60.17/27.33	invGraph after Narrowing: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ main_j <= 4 /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 5 <= main_j /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.004011s
60.17/27.33	Ranking function: 60 - 15*main_i
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 5 <= main_j /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.003127s
60.17/27.33	Ranking function: 176 - 18*main_i - 17*main_j
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 5 <= main_j /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 0 <= main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.002331s
60.17/27.33	Ranking function: -6*main_i + 6*main_j
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001107s
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.047345s
60.17/27.33	[32903 : 32917]
60.17/27.33	[32903 : 32918]
60.17/27.33	Solving with 1 template(s).
60.17/27.33	
60.17/27.33	LOG: CALL solveNonLinearGetFirstSolution
60.17/27.33	
60.17/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053132s
60.17/27.33	Time used: 0.052177
60.17/27.33	Improving Solution with cost 1 ...
60.17/27.33	
60.17/27.33	LOG: CALL solveNonLinearGetNextSolution
60.17/27.33	
60.17/27.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.021686s
60.17/27.33	Time used: 1.0215
60.17/27.33	
60.17/27.33	LOG: SAT solveNonLinear - Elapsed time: 1.074817s
60.17/27.33	Cost: 1; Total time: 1.07368
60.17/27.33	Termination implied by a set of invariant(s):
60.17/27.33	Invariant at l2: 1 <= main_j
60.17/27.33	[ Invariant Graph ]
60.17/27.33	Strengthening and disabling transitions...
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ main_j <= 4 /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ 1 <= main_j /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 1 <= main_i /\ 5 <= main_j /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 1 + main_i <= main_j /\ 1 <= main_i /\ 1 <= main_j /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	[ Termination Graph ]
60.17/27.33	Strengthening and disabling transitions...
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Quasi-ranking function: 50000 - 2*main_i + 3*main_j
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 <= main_j /\ main_j <= 4 /\ 3 + main_j <= main_i /\ 50001 + 3*main_j <= 2*main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 <= main_i /\ 1 + main_j <= main_i /\ 5 <= main_j /\ 50001 + 3*main_j <= 2*main_i, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001420s
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.074162s
60.17/27.33	[32903 : 32926]
60.17/27.33	[32903 : 32927]
60.17/27.33	Solving with 1 template(s).
60.17/27.33	
60.17/27.33	LOG: CALL solveNonLinearGetFirstSolution
60.17/27.33	
60.17/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.062988s
60.17/27.33	Time used: 0.061771
60.17/27.33	Improving Solution with cost 1 ...
60.17/27.33	
60.17/27.33	LOG: CALL solveNonLinearGetNextSolution
60.17/27.33	
60.17/27.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000790s
60.17/27.33	Time used: 1.00074
60.17/27.33	
60.17/27.33	LOG: SAT solveNonLinear - Elapsed time: 1.063778s
60.17/27.33	Cost: 1; Total time: 1.06251
60.17/27.33	Quasi-ranking function: 50000 - main_i
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 1 <= main_j /\ main_j <= 4 /\ 3 + main_j <= main_i /\ 50001 <= main_i /\ 50001 + 3*main_j <= 2*main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 1 + main_j <= main_i /\ 5 <= main_j /\ 50001 <= main_i /\ 50001 + 3*main_j <= 2*main_i, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001505s
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.067600s
60.17/27.33	[32903 : 32935]
60.17/27.33	[32903 : 32936]
60.17/27.33	Solving with 1 template(s).
60.17/27.33	
60.17/27.33	LOG: CALL solveNonLinearGetFirstSolution
60.17/27.33	
60.17/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069805s
60.17/27.33	Time used: 0.068095
60.17/27.33	Improving Solution with cost 1 ...
60.17/27.33	
60.17/27.33	LOG: CALL solveNonLinearGetNextSolution
60.17/27.33	
60.17/27.33	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000793s
60.17/27.33	Time used: 1.00075
60.17/27.33	
60.17/27.33	LOG: SAT solveNonLinear - Elapsed time: 1.070598s
60.17/27.33	Cost: 1; Total time: 1.06884
60.17/27.33	Termination implied by a set of invariant(s):
60.17/27.33	Invariant at l2: 0 <= main_i + main_j
60.17/27.33	[ Invariant Graph ]
60.17/27.33	Strengthening and disabling transitions...
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 <= main_i /\ 1 <= main_j /\ main_j <= 4 /\ 3 + main_j <= main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 <= main_i /\ 1 <= main_j /\ main_j <= 4 /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 <= main_i /\ 1 + main_j <= main_i /\ 1 <= main_j /\ main_j <= 4 /\ main_i <= 2 + main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 <= main_i /\ 5 <= main_j /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 <= main_i /\ 1 + main_j <= main_i /\ 5 <= main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 + main_i <= main_j /\ 1 <= main_i /\ 1 <= main_j /\ 2 + main_i <= 2*main_j, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	[ Termination Graph ]
60.17/27.33	Strengthening and disabling transitions...
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 <= main_j /\ main_j <= 4 /\ 3 + main_j <= main_i /\ 50001 <= main_i /\ 50001 + 3*main_j <= 2*main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	
60.17/27.33	LOG: CALL solverLinear in Graph for feasibility
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear in Graph for feasibility
60.17/27.33	Strengthening transition (result): 
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 + main_j <= main_i /\ 5 <= main_j /\ 50001 <= main_i /\ 50001 + 3*main_j <= 2*main_i, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Quasi-ranking function: 50000 - 2*main_i - main_j
60.17/27.33	New Graphs: 
60.17/27.33	Transitions:
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 <= main_j /\ main_j <= 4 /\ 3 + main_j <= main_i /\ 50001 <= main_i /\ 50001 <= 2*main_i + main_j /\ 50001 + 3*main_j <= 2*main_i, {main_i -> 2 + main_i, main_j -> 1 + main_j, rest remain the same}>
60.17/27.33	<l2, l2, 0 <= main_i + main_j /\ 1 + main_j <= main_i /\ 5 <= main_j /\ 50001 <= main_i /\ 50001 <= 2*main_i + main_j /\ 50001 + 3*main_j <= 2*main_i, {main_i -> 1 + main_i, main_j -> -1 + main_j, rest remain the same}>
60.17/27.33	Variables:
60.17/27.33	main_i, main_j
60.17/27.33	Checking conditional termination of SCC {l2}...
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.001784s
60.17/27.33	
60.17/27.33	LOG: CALL solveLinear
60.17/27.33	
60.17/27.33	LOG: RETURN solveLinear - Elapsed time: 0.163124s
60.17/27.33	[32903 : 32945]
60.17/27.33	[32903 : 32946]
60.17/27.33	Solving with 1 template(s).
60.17/27.33	
60.17/27.33	LOG: CALL solveNonLinearGetFirstSolution
60.17/27.33	
60.17/27.33	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.103056s
60.17/27.33	Time used: 4.10086
60.17/27.33	
60.17/27.33	[32903 : 32956]
60.17/27.33	[32903 : 32960]
60.17/27.33	Successful child: 32956
60.17/27.33	
60.17/27.33	Program does NOT terminate
60.17/27.33	EOF