67.64/28.88	NO
67.64/28.88	
67.64/28.88	Solver Timeout: 4
67.64/28.88	Global Timeout: 300
67.64/28.88	Maximum number of concurrent processes: 900
67.64/28.88	*******************************************************************************************
67.64/28.88	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
67.64/28.88	*******************************************************************************************
67.64/28.88	
67.64/28.88	
67.64/28.88	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
67.64/28.88	
67.64/28.88	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
67.64/28.88	+                                                                  +
67.64/28.88	Init Location: 0
67.64/28.88	Transitions:
67.64/28.88	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_range -> 20, main_up -> 0}>
67.64/28.88	<l1, l2, true>
67.64/28.88	<l2, l20, not((0 <= main_i))>
67.64/28.88	<l2, l3, (0 <= main_i)>
67.64/28.88	<l3, l20, not((main_i <= main_range))>
67.64/28.88	<l3, l4, (main_i <= main_range)>
67.64/28.88	<l4, l5, (main_i = 0)>
67.64/28.88	<l4, l7, not((main_i = 0))>
67.64/28.88	<l5, l6, true, seq{main_up -> 1}>
67.64/28.88	<l6, l7, true>
67.64/28.88	<l7, l8, (main_i = main_range)>
67.64/28.88	<l7, l10, not((main_i = main_range))>
67.64/28.88	<l8, l9, true, seq{main_up -> 0}>
67.64/28.88	<l9, l10, true>
67.64/28.88	<l10, l11, (main_up = 1)>
67.64/28.88	<l10, l13, not((main_up = 1))>
67.64/28.88	<l11, l12, true, seq{main_i -> (main_i + 1)}>
67.64/28.88	<l12, l13, true>
67.64/28.88	<l13, l14, (main_up = 0)>
67.64/28.88	<l13, l16, not((main_up = 0))>
67.64/28.88	<l14, l15, true, seq{main_i -> (main_i - 1)}>
67.64/28.88	<l15, l16, true>
67.64/28.88	<l16, l17, (main_i = (main_range - 2))>
67.64/28.88	<l16, l19, not((main_i = (main_range - 2)))>
67.64/28.88	<l17, l18, true, seq{main_range -> (main_range - 1)}>
67.64/28.88	<l18, l19, true>
67.64/28.88	<l19, l2, true>
67.64/28.88	<l20, l21, true, seq{main__func_return_ -> 0}>
67.64/28.88	
67.64/28.88	Fresh variables:
67.64/28.88	
67.64/28.88	Undef variables:
67.64/28.88	
67.64/28.88	Abstraction variables:
67.64/28.88	
67.64/28.88	Exit nodes:
67.64/28.88	
67.64/28.88	Accepting locations:
67.64/28.88	
67.64/28.88	Asserts:
67.64/28.88	
67.64/28.88	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
67.64/28.88	       
67.64/28.88	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
67.64/28.88	       
67.64/28.88	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
67.64/28.88	
67.64/28.88	Init Location: 0
67.64/28.88	Transitions:
67.64/28.88	<l0, l22, true, seq{main__func_return_ -> 0}>
67.64/28.88	<l22, l23, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
67.64/28.88	<l23, l1, true, seq{main_i -> varCall_1, main_range -> 20, main_up -> 0}>
67.64/28.89	<l1, l2, true>
67.64/28.89	<l2, l3, (0 <= main_i)>
67.64/28.89	<l2, l20, not((0 <= main_i))>
67.64/28.89	<l3, l4, (main_i <= main_range)>
67.64/28.89	<l3, l20, not((main_i <= main_range))>
67.64/28.89	<l4, l5, (main_i = 0)>
67.64/28.89	<l4, l7, not((main_i = 0))>
67.64/28.89	<l5, l6, true, seq{main_up -> 1}>
67.64/28.89	<l6, l7, true>
67.64/28.89	<l7, l8, (main_i = main_range)>
67.64/28.89	<l7, l10, not((main_i = main_range))>
67.64/28.89	<l8, l9, true, seq{main_up -> 0}>
67.64/28.89	<l9, l10, true>
67.64/28.89	<l10, l11, (main_up = 1)>
67.64/28.89	<l10, l13, not((main_up = 1))>
67.64/28.89	<l11, l12, true, seq{main_i -> (main_i + 1)}>
67.64/28.89	<l12, l13, true>
67.64/28.89	<l13, l14, (main_up = 0)>
67.64/28.89	<l13, l16, not((main_up = 0))>
67.64/28.89	<l14, l15, true, seq{main_i -> (main_i - 1)}>
67.64/28.89	<l15, l16, true>
67.64/28.89	<l16, l17, (main_i = (main_range - 2))>
67.64/28.89	<l16, l19, not((main_i = (main_range - 2)))>
67.64/28.89	<l17, l18, true, seq{main_range -> (main_range - 1)}>
67.64/28.89	<l18, l19, true>
67.64/28.89	<l19, l2, true>
67.64/28.89	<l20, l21, true, seq{main__func_return_ -> 0}>
67.64/28.89	
67.64/28.89	Fresh variables:
67.64/28.89	
67.64/28.89	Undef variables:
67.64/28.89	
67.64/28.89	Abstraction variables:
67.64/28.89	
67.64/28.89	Exit nodes:
67.64/28.89	21, 
67.64/28.89	Accepting locations:
67.64/28.89	
67.64/28.89	Asserts:
67.64/28.89	
67.64/28.89	+                                                                  +
67.64/28.89	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
67.64/28.89	
67.64/28.89	
67.64/28.89	Function Return and Parameters Information [2 functions]:
67.64/28.89	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
67.64/28.89	        __VERIFIER_nondet_int__func_return_      [function result] : int
67.64/28.89	    function name: main [1 return + 0 parameters]        demangled: main
67.64/28.89	        main__func_return_      [function result] : int
67.64/28.89	
67.64/28.89	
67.64/28.89	AST Ident Scanner Information [5 idents]:
67.64/28.89	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 9, col: 9>
67.64/28.89	main | function | [integer, ()] | <line: 5, col: 1>
67.64/28.89	i | local variable | integer | <line: 6, col: 5> | <line: 9, col: 5> <line: 13, col: 17> <line: 13, col: 22> <line: 14, col: 13> <line: 17, col: 13> <line: 21, col: 13> <line: 21, col: 17> <line: 24, col: 13> <line: 24, col: 17> <line: 26, col: 13>
67.64/28.89	range | local variable | integer | <line: 7, col: 5> | <line: 10, col: 5> <line: 13, col: 27> <line: 17, col: 18> <line: 26, col: 18> <line: 27, col: 13> <line: 27, col: 21>
67.64/28.89	up | local variable | integer | <line: 8, col: 5> | <line: 11, col: 5> <line: 15, col: 13> <line: 18, col: 13> <line: 20, col: 13> <line: 23, col: 13>
67.64/28.89	
67.64/28.89	Main function: main
67.64/28.89	Preprocessed LLVMGraph
67.64/28.89	Init Location: 0
67.64/28.89	Transitions:
67.64/28.89	<l0, l2, (main_i = undef2) /\ (main_range = 20) /\ (main_up = 0)>
67.64/28.89	<l2, l10, (0 <= main_i) /\ (main_i <= main_range) /\ (main_i = 0) /\ (main_i = main_range), par{main_up -> 0}>
67.64/28.89	<l2, l10, (0 <= main_i) /\ (main_i <= main_range) /\ (main_i = 0) /\ (main_i < main_range), par{main_up -> 1}>
67.64/28.89	<l2, l10, (0 <= main_i) /\ (main_i <= main_range) /\ (main_i > 0) /\ (main_i = main_range), par{main_up -> 0}>
67.64/28.89	<l2, l10, (0 <= main_i) /\ (main_i <= main_range) /\ (main_i > 0) /\ (main_i < main_range)>
67.64/28.89	<l2, l21, (0 <= main_i) /\ not((main_i <= main_range))>
67.64/28.89	<l2, l21, not((0 <= main_i))>
67.64/28.89	<l10, l2, (main_up = 1) /\ (main_up > 0) /\ ((main_i + 1) = (main_range - 2)), par{main_i -> (main_i + 1), main_range -> (main_range - 1)}>
67.64/28.89	<l10, l2, (main_up = 1) /\ (main_up > 0) /\ ((main_i + 1) < (main_range - 2)), par{main_i -> (main_i + 1)}>
67.64/28.89	<l10, l2, (main_up = 1) /\ (main_up > 0) /\ ((main_i + 1) > (main_range - 2)), par{main_i -> (main_i + 1)}>
67.64/28.89	<l10, l2, (main_up < 1) /\ (main_up = 0) /\ ((main_i - 1) = (main_range - 2)), par{main_i -> (main_i - 1), main_range -> (main_range - 1)}>
67.64/28.89	<l10, l2, (main_up < 1) /\ (main_up = 0) /\ ((main_i - 1) < (main_range - 2)), par{main_i -> (main_i - 1)}>
67.64/28.89	<l10, l2, (main_up < 1) /\ (main_up = 0) /\ ((main_i - 1) > (main_range - 2)), par{main_i -> (main_i - 1)}>
67.64/28.89	<l10, l2, (main_up < 1) /\ (main_up < 0) /\ (main_i = (main_range - 2)), par{main_range -> (main_range - 1)}>
67.64/28.89	<l10, l2, (main_up < 1) /\ (main_up < 0) /\ (main_i < (main_range - 2))>
67.64/28.89	<l10, l2, (main_up < 1) /\ (main_up < 0) /\ (main_i > (main_range - 2))>
67.64/28.89	<l10, l2, (main_up > 1) /\ (main_up > 0) /\ (main_i = (main_range - 2)), par{main_range -> (main_range - 1)}>
67.64/28.89	<l10, l2, (main_up > 1) /\ (main_up > 0) /\ (main_i < (main_range - 2))>
67.64/28.89	<l10, l2, (main_up > 1) /\ (main_up > 0) /\ (main_i > (main_range - 2))>
67.64/28.89	
67.64/28.89	Fresh variables:
67.64/28.89	undef2, 
67.64/28.89	
67.64/28.89	Undef variables:
67.64/28.89	undef2, 
67.64/28.89	
67.64/28.89	Abstraction variables:
67.64/28.89	
67.64/28.89	Exit nodes:
67.64/28.89	21, 
67.64/28.89	Accepting locations:
67.64/28.89	
67.64/28.89	Asserts:
67.64/28.89	
67.64/28.89	*************************************************************
67.64/28.89	*******************************************************************************************
67.64/28.89	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
67.64/28.89	*******************************************************************************************
67.64/28.89	
67.64/28.89	Init Location: 0
67.64/28.89	Graph 0:
67.64/28.89	Transitions:
67.64/28.89	Variables:
67.64/28.89	
67.64/28.89	Graph 1:
67.64/28.89	Transitions:
67.64/28.89	<l2, l10, main_i = 0 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l10, 1 + main_i <= main_range /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l10, 1 <= main_i /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l10, 1 + main_i <= main_range /\ 1 <= main_i, {all remain the same}>
67.64/28.89	<l10, l2, main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, 2 + main_i <= main_range /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_range <= main_i /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, 1 + main_up <= 0 /\ 2 + main_i = main_range, {main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, 1 + main_up <= 0 /\ 3 + main_i <= main_range, {all remain the same}>
67.64/28.89	<l10, l2, 1 + main_up <= 0 /\ main_range <= 1 + main_i, {all remain the same}>
67.64/28.89	<l10, l2, 2 <= main_up /\ 2 + main_i = main_range, {main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, 2 <= main_up /\ 3 + main_i <= main_range, {all remain the same}>
67.64/28.89	<l10, l2, 2 <= main_up /\ main_range <= 1 + main_i, {all remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	
67.64/28.89	Graph 2:
67.64/28.89	Transitions:
67.64/28.89	Variables:
67.64/28.89	
67.64/28.89	Precedence: 
67.64/28.89	Graph 0
67.64/28.89	
67.64/28.89	Graph 1
67.64/28.89	<l0, l2, main_i = undef2 /\ main_up = 0 /\ main_range = 20, {all remain the same}>
67.64/28.89	
67.64/28.89	Graph 2
67.64/28.89	<l2, l21, 0 <= main_i /\ 1 + main_range <= main_i, {all remain the same}>
67.64/28.89	<l2, l21, 1 + main_i <= 0, {all remain the same}>
67.64/28.89	
67.64/28.89	Map Locations to Subgraph:
67.64/28.89	( 0 , 0 )
67.64/28.89	( 2 , 1 )
67.64/28.89	( 10 , 1 )
67.64/28.89	( 21 , 2 )
67.64/28.89	
67.64/28.89	*******************************************************************************************
67.64/28.89	********************************    CHECKING ASSERTIONS    ********************************
67.64/28.89	*******************************************************************************************
67.64/28.89	
67.64/28.89	Proving termination of subgraph 0
67.64/28.89	Proving termination of subgraph 1
67.64/28.89	Checking unfeasibility...
67.64/28.89	Time used: 0.073864
67.64/28.89	Some transition disabled by a set of invariant(s):
67.64/28.89	Invariant at l2: main_up <= 1
67.64/28.89	Invariant at l10: main_up <= 1
67.64/28.89	
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	> It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 2 <= main_up /\ 2 + main_i = main_range, {main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	> It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 2 <= main_up /\ 3 + main_i <= main_range, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, main_up <= 1 /\ main_i = 0 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 2 + main_i <= main_range /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_range <= main_i /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 1 + main_up <= 0 /\ 2 + main_i = main_range, {main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 1 + main_up <= 0 /\ 3 + main_i <= main_range, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 1 + main_up <= 0 /\ main_range <= 1 + main_i, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 2 <= main_up /\ main_range <= 1 + main_i, {all remain the same}>
67.64/28.89	Checking unfeasibility...
67.64/28.89	Time used: 0.039951
67.64/28.89	Some transition disabled by a set of invariant(s):
67.64/28.89	Invariant at l2: 0 <= main_up
67.64/28.89	Invariant at l10: 0 <= main_up
67.64/28.89	
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	> It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 1 + main_up <= 0 /\ main_range <= 1 + main_i, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ main_up <= 1 /\ main_i = 0 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 2 + main_i <= main_range /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_range <= main_i /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 1 + main_up <= 0 /\ 2 + main_i = main_range, {main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 1 + main_up <= 0 /\ 3 + main_i <= main_range, {all remain the same}>
67.64/28.89	Checking unfeasibility...
67.64/28.89	Time used: 2.42798
67.64/28.89	
67.64/28.89	Checking conditional termination of SCC {l2, l10}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.012836s
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.082682s
67.64/28.89	[11634 : 11818]
67.64/28.89	[11634 : 11819]
67.64/28.89	Successful child: 11818
67.64/28.89	[ Invariant Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ main_up <= 1 /\ main_i = 0 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_range <= main_i /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	[ Termination Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ main_up <= 1 /\ main_i = 0 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_range <= main_i /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Ranking function: main_range
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_up /\ main_up <= 1 /\ main_i = 0 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, 1 <= main_i /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, 1 + main_i <= main_range /\ 1 <= main_i /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, 1 <= main_i /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.004088s
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.084020s
67.64/28.89	Piecewise ranking function: min(7*main_i - 12*main_range,-12*main_range)
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, 1 <= main_i /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, 1 + main_i <= main_range /\ 1 <= main_i /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, 1 <= main_i /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.003603s
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.239131s
67.64/28.89	[11634 : 11823]
67.64/28.89	[11634 : 11824]
67.64/28.89	Successful child: 11823
67.64/28.89	[ Invariant Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i + main_range <= main_up /\ main_up <= 1 /\ main_i = 0 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_i + main_range + main_up <= 0 /\ 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_i + main_range + main_up <= 0 /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_i + main_range + main_up <= 0 /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_i + main_range + main_up <= 0 /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_i + main_range + main_up <= 0 /\ main_range <= main_i /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	[ Termination Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	> It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 1 <= main_i /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 1 + main_i <= main_range /\ 1 <= main_i /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 1 <= main_i /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	New Graphs: 
67.64/28.89	INVARIANTS: 
67.64/28.89	2: 0 <= main_up , 
67.64/28.89	10: 0 <= 1 + main_i + main_up , 
67.64/28.89	Quasi-INVARIANTS to narrow Graph: 
67.64/28.89	2: 
67.64/28.89	10: 
67.64/28.89	
67.64/28.89	LOG: CALL check - Post:1 + main_i + main_range <= main_up - Process 1
67.64/28.89	* Exit transition: <l0, l2, main_i = undef2 /\ main_up = 0 /\ main_range = 20, {all remain the same}>
67.64/28.89	* Postcondition  : 1 + main_i + main_range <= main_up
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.001139s
67.64/28.89	> Postcondition is not implied!
67.64/28.89	
67.64/28.89	LOG: RETURN check - Elapsed time: 0.001257s
67.64/28.89	INVARIANTS: 
67.64/28.89	2: 
67.64/28.89	10: 
67.64/28.89	Quasi-INVARIANTS to narrow Graph: 
67.64/28.89	2: 1 + main_i + main_range <= main_up , 
67.64/28.89	10: main_i + main_range + main_up <= 0 , 
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, 0 <= main_up /\ main_up <= 1 /\ main_i = 0 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	Narrowing transition: 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l2, l10, 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, 2 + main_i <= main_range /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_range <= main_i /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	invGraph after Narrowing: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l10, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l10, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l10, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_range <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_range -> -1 + main_range, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_range -> -1 + main_range, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_range -> -1 + main_range, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.011977s
67.64/28.89	Ranking function: -27 + 9*main_range
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.007969s
67.64/28.89	Ranking function: main_range
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.004466s
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.576712s
67.64/28.89	[11634 : 11828]
67.64/28.89	[11634 : 11829]
67.64/28.89	Successful child: 11828
67.64/28.89	[ Invariant Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_range <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	[ Termination Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	> It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	New Graphs: 
67.64/28.89	
67.64/28.89	LOG: CALL check - Post:1 + main_range <= main_i - Process 2
67.64/28.89	* Exit transition: <l0, l2, main_up <= main_i + main_range /\ main_i = undef2 /\ main_up = 0 /\ main_range = 20, {all remain the same}>
67.64/28.89	* Postcondition  : 1 + main_range <= main_i
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.001540s
67.64/28.89	> Postcondition is not implied!
67.64/28.89	
67.64/28.89	LOG: RETURN check - Elapsed time: 0.001658s
67.64/28.89	INVARIANTS: 
67.64/28.89	2: 
67.64/28.89	10: 
67.64/28.89	Quasi-INVARIANTS to narrow Graph: 
67.64/28.89	2: 0 <= main_i + main_range , 1 + main_range <= main_i , 
67.64/28.89	10: 1 + main_range <= main_i + main_up , 1 + main_up <= 0 , 
67.64/28.89	Narrowing transition: 
67.64/28.89	<l2, l10, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 2
67.64/28.89	Narrowing transition: 
67.64/28.89	<l2, l10, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 2
67.64/28.89	Narrowing transition: 
67.64/28.89	<l2, l10, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 2
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 2
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 2
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 2
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 2
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 2
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_range <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 2
67.64/28.89	invGraph after Narrowing: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_range <= main_i /\ 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ main_range <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_range -> -1 + main_range, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_range -> -1 + main_range, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_range -> -1 + main_range, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.012053s
67.64/28.89	Ranking function: -27 + 9*main_range
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.009032s
67.64/28.89	Ranking function: (~(1) / 2) + main_range
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.005110s
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.526495s
67.64/28.89	[11634 : 11833]
67.64/28.89	[11634 : 11834]
67.64/28.89	Successful child: 11833
67.64/28.89	[ Invariant Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_range <= main_i /\ 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ main_range <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	[ Termination Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	New Graphs: 
67.64/28.89	
67.64/28.89	LOG: CALL check - Post:1 + main_i + main_up <= 0 - Process 3
67.64/28.89	* Exit transition: <l0, l2, main_i <= main_range /\ main_up <= main_i + main_range /\ main_i = undef2 /\ main_up = 0 /\ main_range = 20, {all remain the same}>
67.64/28.89	* Postcondition  : 1 + main_i + main_up <= 0
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.001819s
67.64/28.89	> Postcondition is not implied!
67.64/28.89	
67.64/28.89	LOG: RETURN check - Elapsed time: 0.001945s
67.64/28.89	INVARIANTS: 
67.64/28.89	2: 
67.64/28.89	10: 
67.64/28.89	Quasi-INVARIANTS to narrow Graph: 
67.64/28.89	2: 1 + main_i + main_up <= 0 , 
67.64/28.89	10: 1 + main_up <= 0 , 
67.64/28.89	Narrowing transition: 
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_range <= main_i /\ 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	Narrowing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ main_range <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: Narrow transition size 1
67.64/28.89	invGraph after Narrowing: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_i = 0, {main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ main_up <= 1, {all remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_range <= main_i /\ 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ main_range <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2, l10}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.011783s
67.64/28.89	Ranking function: -12 + 8*main_range
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_range -> -1 + main_range, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> 1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_range -> -1 + main_range, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	It's unfeasible after collapsing. Removing transition: 
67.64/28.89	<l2, l2, 1 <= 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.010059s
67.64/28.89	Ranking function: main_range
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 + main_i <= main_range /\ main_up <= 1 /\ main_range <= 2 + main_i /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 + main_i <= main_range /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ main_range <= 2 + main_i /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.005758s
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.555332s
67.64/28.89	[11634 : 11838]
67.64/28.89	[11634 : 11839]
67.64/28.89	Successful child: 11838
67.64/28.89	[ Invariant Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ main_up <= 1 /\ main_i = 0 /\ 1 + main_i = main_range, {main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ main_i = main_range, {main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l10, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 <= main_i /\ main_up <= 1 /\ 1 + main_i = main_range, {all remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 1 /\ 3 + main_i = main_range, {main_i -> 1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ main_range <= 1 + main_i /\ 0 <= 1 + main_i + main_up /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ main_range <= 1 + main_i /\ 0 <= 1 + main_i + main_up /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0 /\ 1 + main_i = main_range, {main_i -> -1 + main_i, main_range -> -1 + main_range, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_range <= main_i /\ 1 + main_range <= main_i + main_up /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l10, l2, main_i + main_up <= main_range /\ main_range <= main_i /\ 1 <= main_i + main_range + main_up /\ 0 <= 1 + main_i + main_up /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	[ Termination Graph ]
67.64/28.89	Strengthening and disabling transitions...
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ main_up <= 1 /\ 4 + main_i <= main_range /\ main_i = 0, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ main_up <= 1 /\ main_i = 0 /\ 1 + main_i = main_range, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 4 + main_i <= main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	Strengthening transition (result): 
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 1 + main_i = main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	
67.64/28.89	LOG: CALL solverLinear in Graph for feasibility
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear in Graph for feasibility
67.64/28.89	It's unfeasible. Removing transition: 
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 2 + main_i <= main_range /\ main_up = 0, {main_i -> -1 + main_i, rest remain the same}>
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ main_up <= 1 /\ main_i = 0 /\ 1 + main_i = main_range, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	<l2, l2, main_i + main_up <= main_range /\ 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 1 <= main_i /\ 1 <= main_i + main_range + main_up /\ 1 + main_i = main_range /\ main_up = 1, {main_i -> 1 + main_i, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.003107s
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.028792s
67.64/28.89	Piecewise ranking function: min(main_up,-main_i + main_range)
67.64/28.89	New Graphs: 
67.64/28.89	Transitions:
67.64/28.89	<l2, l2, 0 <= main_i + main_range /\ main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ main_up <= 1 /\ main_i = 0 /\ 1 + main_i = main_range, {main_i -> 1 + main_i, main_up -> 1, rest remain the same}>
67.64/28.89	<l2, l2, main_up <= main_i + main_range /\ 0 <= main_i + main_up /\ 0 <= main_up /\ 1 <= main_i /\ 1 <= main_i + main_range /\ main_up <= 1 /\ main_i = main_range, {main_i -> -1 + main_i, main_up -> 0, rest remain the same}>
67.64/28.89	Variables:
67.64/28.89	main_i, main_range, main_up
67.64/28.89	Checking conditional termination of SCC {l2}...
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.002136s
67.64/28.89	
67.64/28.89	LOG: CALL solveLinear
67.64/28.89	
67.64/28.89	LOG: RETURN solveLinear - Elapsed time: 0.013077s
67.64/28.89	[11634 : 11843]
67.64/28.89	[11634 : 11844]
67.64/28.89	Solving with 1 template(s).
67.64/28.89	
67.64/28.89	LOG: CALL solveNonLinearGetFirstSolution
67.64/28.89	
67.64/28.89	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101803s
67.64/28.89	Time used: 4.1002
67.64/28.89	
67.64/28.89	[11634 : 11849]
67.64/28.89	[11634 : 11853]
67.64/28.89	Successful child: 11849
67.64/28.89	
67.64/28.89	Program does NOT terminate
67.64/28.89	EOF