15.86/8.00	YES
15.86/8.00	
15.86/8.00	Solver Timeout: 4
15.86/8.00	Global Timeout: 300
15.86/8.00	Maximum number of concurrent processes: 900
15.86/8.00	*******************************************************************************************
15.86/8.00	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
15.86/8.00	*******************************************************************************************
15.86/8.00	
15.86/8.00	
15.86/8.00	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
15.86/8.00	
15.86/8.00	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
15.86/8.00	+                                                                  +
15.86/8.00	Init Location: 0
15.86/8.00	Transitions:
15.86/8.00	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
15.86/8.00	<l1, l2, true>
15.86/8.00	<l2, l11, not((main_x > 0))>
15.86/8.00	<l2, l3, (main_x > 0)>
15.86/8.00	<l3, l11, not((main_y > 0))>
15.86/8.00	<l3, l4, (main_y > 0)>
15.86/8.00	<l4, l5, true, seq{main_oldx -> main_x, main_oldy -> main_y}>
15.86/8.00	<l5, l6, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
15.86/8.00	<l5, l8, (¿functionCall(__VERIFIER_nondet_int) = 0)>
15.86/8.00	<l6, l7, true, seq{main_x -> (main_oldx - 1), main_y -> main_oldx}>
15.86/8.00	<l7, l10, true>
15.86/8.00	<l8, l9, true, seq{main_x -> (main_oldy - 2), main_y -> (main_oldx + 1)}>
15.86/8.00	<l9, l10, true>
15.86/8.00	<l10, l2, true>
15.86/8.00	<l11, l12, true, seq{main__func_return_ -> 0}>
15.86/8.00	
15.86/8.00	Fresh variables:
15.86/8.00	
15.86/8.00	Undef variables:
15.86/8.00	
15.86/8.00	Abstraction variables:
15.86/8.00	
15.86/8.00	Exit nodes:
15.86/8.00	
15.86/8.00	Accepting locations:
15.86/8.00	
15.86/8.00	Asserts:
15.86/8.00	
15.86/8.00	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
15.86/8.00	       
15.86/8.00	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
15.86/8.00	       
15.86/8.00	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
15.86/8.00	
15.86/8.00	Init Location: 0
15.86/8.00	Transitions:
15.86/8.00	<l0, l13, true, seq{main__func_return_ -> 0}>
15.86/8.00	<l13, l14, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
15.86/8.00	<l14, l15, true, seq{main_x -> varCall_1}>
15.86/8.00	<l15, l16, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
15.86/8.00	<l16, l1, true, seq{main_y -> varCall_2}>
15.86/8.00	<l1, l2, true>
15.86/8.00	<l2, l3, (main_x > 0)>
15.86/8.00	<l2, l11, not((main_x > 0))>
15.86/8.00	<l3, l4, (main_y > 0)>
15.86/8.00	<l3, l11, not((main_y > 0))>
15.86/8.00	<l4, l5, true, seq{main_oldx -> main_x, main_oldy -> main_y}>
15.86/8.00	<l5, l17, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
15.86/8.00	<l17, l8, (varCall_3 = 0)>
15.86/8.00	<l17, l6, (varCall_3 = 1)>
15.86/8.00	<l6, l7, true, seq{main_x -> (main_oldx - 1), main_y -> main_oldx}>
15.86/8.00	<l7, l10, true>
15.86/8.00	<l8, l9, true, seq{main_x -> (main_oldy - 2), main_y -> (main_oldx + 1)}>
15.86/8.00	<l9, l10, true>
15.86/8.00	<l10, l2, true>
15.86/8.00	<l11, l12, true, seq{main__func_return_ -> 0}>
15.86/8.00	
15.86/8.00	Fresh variables:
15.86/8.00	
15.86/8.00	Undef variables:
15.86/8.00	
15.86/8.00	Abstraction variables:
15.86/8.00	
15.86/8.00	Exit nodes:
15.86/8.00	12, 
15.86/8.00	Accepting locations:
15.86/8.00	
15.86/8.00	Asserts:
15.86/8.00	
15.86/8.00	+                                                                  +
15.86/8.00	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
15.86/8.00	
15.86/8.00	
15.86/8.00	Function Return and Parameters Information [2 functions]:
15.86/8.00	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
15.86/8.00	        __VERIFIER_nondet_int__func_return_      [function result] : int
15.86/8.00	    function name: main [1 return + 0 parameters]        demangled: main
15.86/8.00	        main__func_return_      [function result] : int
15.86/8.00	
15.86/8.00	
15.86/8.00	AST Ident Scanner Information [6 idents]:
15.86/8.00	__VERIFIER_nondet_int | function | [integer, ()] | <line: 15, col: 1> | <line: 19, col: 6> <line: 20, col: 6> <line: 24, col: 7>
15.86/8.00	main | function | [integer, ()] | <line: 17, col: 1>
15.86/8.00	x | local variable | integer | <line: 18, col: 5> | <line: 19, col: 2> <line: 21, col: 9> <line: 22, col: 10> <line: 25, col: 4> <line: 28, col: 4>
15.86/8.00	y | local variable | integer | <line: 18, col: 5> | <line: 20, col: 2> <line: 21, col: 18> <line: 23, col: 10> <line: 26, col: 4> <line: 29, col: 4>
15.86/8.00	oldx | local variable | integer | <line: 18, col: 5> | <line: 22, col: 3> <line: 25, col: 8> <line: 26, col: 8> <line: 29, col: 8>
15.86/8.00	oldy | local variable | integer | <line: 18, col: 5> | <line: 23, col: 3> <line: 28, col: 8>
15.86/8.00	
15.86/8.00	Main function: main
15.86/8.00	Preprocessed LLVMGraph
15.86/8.00	Init Location: 0
15.86/8.00	Transitions:
15.86/8.00	<l0, l2, (main_x = undef4) /\ (main_y = undef5)>
15.86/8.00	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef6 = 0), par{main_x -> (main_y - 2), main_y -> (main_x + 1)}>
15.86/8.00	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef6 = 1), par{main_x -> (main_x - 1), main_y -> main_x}>
15.86/8.00	<l2, l12, (main_x > 0) /\ not((main_y > 0))>
15.86/8.00	<l2, l12, not((main_x > 0))>
15.86/8.00	
15.86/8.00	Fresh variables:
15.86/8.00	undef4, undef5, undef6, 
15.86/8.00	
15.86/8.00	Undef variables:
15.86/8.00	undef4, undef5, undef6, 
15.86/8.00	
15.86/8.00	Abstraction variables:
15.86/8.00	
15.86/8.00	Exit nodes:
15.86/8.00	12, 
15.86/8.00	Accepting locations:
15.86/8.00	
15.86/8.00	Asserts:
15.86/8.00	
15.86/8.00	*************************************************************
15.86/8.00	*******************************************************************************************
15.86/8.00	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
15.86/8.00	*******************************************************************************************
15.86/8.00	
15.86/8.00	Init Location: 0
15.86/8.00	Graph 0:
15.86/8.00	Transitions:
15.86/8.00	Variables:
15.86/8.00	
15.86/8.00	Graph 1:
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	
15.86/8.00	Graph 2:
15.86/8.00	Transitions:
15.86/8.00	Variables:
15.86/8.00	
15.86/8.00	Precedence: 
15.86/8.00	Graph 0
15.86/8.00	
15.86/8.00	Graph 1
15.86/8.00	<l0, l2, main_x = undef4 /\ main_y = undef5, {all remain the same}>
15.86/8.00	
15.86/8.00	Graph 2
15.86/8.00	<l2, l12, main_y <= 0 /\ 1 <= main_x, {all remain the same}>
15.86/8.00	<l2, l12, main_x <= 0, {all remain the same}>
15.86/8.00	
15.86/8.00	Map Locations to Subgraph:
15.86/8.00	( 0 , 0 )
15.86/8.00	( 2 , 1 )
15.86/8.00	( 12 , 2 )
15.86/8.00	
15.86/8.00	*******************************************************************************************
15.86/8.00	********************************    CHECKING ASSERTIONS    ********************************
15.86/8.00	*******************************************************************************************
15.86/8.00	
15.86/8.00	Proving termination of subgraph 0
15.86/8.00	Proving termination of subgraph 1
15.86/8.00	Checking unfeasibility...
15.86/8.00	Time used: 0.00388
15.86/8.00	
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.001174s
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.015305s
15.86/8.00	[54953 : 54955]
15.86/8.00	[54953 : 54956]
15.86/8.00	Successful child: 54955
15.86/8.00	[ Invariant Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	[ Termination Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	New Graphs: 
15.86/8.00	
15.86/8.00	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
15.86/8.00	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5, {all remain the same}>
15.86/8.00	* Postcondition  : 1 + main_x <= 0
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.000518s
15.86/8.00	> Postcondition is not implied!
15.86/8.00	
15.86/8.00	LOG: RETURN check - Elapsed time: 0.000610s
15.86/8.00	INVARIANTS: 
15.86/8.00	2: 
15.86/8.00	Quasi-INVARIANTS to narrow Graph: 
15.86/8.00	2: 1 + main_x <= 0 , 
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	invGraph after Narrowing: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.001129s
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.015494s
15.86/8.00	[54953 : 54960]
15.86/8.00	[54953 : 54961]
15.86/8.00	Successful child: 54960
15.86/8.00	[ Invariant Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	[ Termination Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	New Graphs: 
15.86/8.00	
15.86/8.00	LOG: CALL check - Post:main_y <= 0 - Process 2
15.86/8.00	* Exit transition: <l0, l2, 0 <= main_x /\ main_x = undef4 /\ main_y = undef5, {all remain the same}>
15.86/8.00	* Postcondition  : main_y <= 0
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.000647s
15.86/8.00	> Postcondition is not implied!
15.86/8.00	
15.86/8.00	LOG: RETURN check - Elapsed time: 0.000740s
15.86/8.00	INVARIANTS: 
15.86/8.00	2: 
15.86/8.00	Quasi-INVARIANTS to narrow Graph: 
15.86/8.00	2: main_y <= 0 , 
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	invGraph after Narrowing: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.001101s
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.015438s
15.86/8.00	[54953 : 54965]
15.86/8.00	[54953 : 54966]
15.86/8.00	Successful child: 54965
15.86/8.00	[ Invariant Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	[ Termination Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	New Graphs: 
15.86/8.00	
15.86/8.00	LOG: CALL check - Post:main_x <= 0 - Process 3
15.86/8.00	* Exit transition: <l0, l2, 0 <= main_x /\ 1 <= main_y /\ main_x = undef4 /\ main_y = undef5, {all remain the same}>
15.86/8.00	* Postcondition  : main_x <= 0
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.000672s
15.86/8.00	> Postcondition is not implied!
15.86/8.00	
15.86/8.00	LOG: RETURN check - Elapsed time: 0.000793s
15.86/8.00	INVARIANTS: 
15.86/8.00	2: 
15.86/8.00	Quasi-INVARIANTS to narrow Graph: 
15.86/8.00	2: main_x <= 0 , 
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	invGraph after Narrowing: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.001095s
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.015622s
15.86/8.00	[54953 : 54970]
15.86/8.00	[54953 : 54971]
15.86/8.00	Successful child: 54970
15.86/8.00	[ Invariant Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x + main_y <= 3 /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x + main_y <= 3 /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	[ Termination Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x + main_y <= 3 /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x + main_y <= 3 /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Ranking function: main_x + main_y
15.86/8.00	New Graphs: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x + main_y <= 3 /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.001001s
15.86/8.00	Ranking function: -1 + main_x
15.86/8.00	New Graphs: 
15.86/8.00	
15.86/8.00	LOG: CALL check - Post:main_x + main_y <= 3 - Process 4
15.86/8.00	* Exit transition: <l0, l2, 1 <= main_x /\ 1 <= main_y /\ main_x = undef4 /\ main_y = undef5, {all remain the same}>
15.86/8.00	* Postcondition  : main_x + main_y <= 3
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.000559s
15.86/8.00	> Postcondition is not implied!
15.86/8.00	
15.86/8.00	LOG: RETURN check - Elapsed time: 0.000668s
15.86/8.00	INVARIANTS: 
15.86/8.00	2: 
15.86/8.00	Quasi-INVARIANTS to narrow Graph: 
15.86/8.00	2: main_x + main_y <= 3 , 
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	invGraph after Narrowing: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.001255s
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.024066s
15.86/8.00	[54953 : 54975]
15.86/8.00	[54953 : 54976]
15.86/8.00	Successful child: 54975
15.86/8.00	[ Invariant Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ 2*main_x + main_y <= 6 /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ 2*main_x + main_y <= 6 /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	[ Termination Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ 2*main_x + main_y <= 6 /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ 2*main_x + main_y <= 6 /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Ranking function: main_x + main_y
15.86/8.00	New Graphs: 
15.86/8.00	
15.86/8.00	LOG: CALL check - Post:2*main_x + main_y <= 6 - Process 5
15.86/8.00	* Exit transition: <l0, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ main_x = undef4 /\ main_y = undef5, {all remain the same}>
15.86/8.00	* Postcondition  : 2*main_x + main_y <= 6
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.000626s
15.86/8.00	> Postcondition is not implied!
15.86/8.00	
15.86/8.00	LOG: RETURN check - Elapsed time: 0.000752s
15.86/8.00	INVARIANTS: 
15.86/8.00	2: 
15.86/8.00	Quasi-INVARIANTS to narrow Graph: 
15.86/8.00	2: 2*main_x + main_y <= 6 , 
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	invGraph after Narrowing: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.001528s
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.046447s
15.86/8.00	[54953 : 54980]
15.86/8.00	[54953 : 54981]
15.86/8.00	Successful child: 54980
15.86/8.00	[ Invariant Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 4 <= main_x + main_y /\ main_x + main_y <= 6 /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 4 <= main_x + main_y /\ main_x + main_y <= 6 /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	[ Termination Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 4 <= main_x + main_y /\ main_x + main_y <= 6 /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 4 <= main_x + main_y /\ main_x + main_y <= 6 /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Ranking function: -10 + 3*main_x + 2*main_y
15.86/8.00	New Graphs: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 4 <= main_x + main_y /\ main_x + main_y <= 6 /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.001500s
15.86/8.00	Ranking function: -1 + main_x + main_y
15.86/8.00	New Graphs: 
15.86/8.00	[54953 : 54985]
15.86/8.00	[54953 : 54986]
15.86/8.00	INVARIANTS: 
15.86/8.00	2: 
15.86/8.00	Quasi-INVARIANTS to narrow Graph: 
15.86/8.00	2: main_x <= 1 + main_y , main_x + main_y <= 6 , 
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 2
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 4 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 2
15.86/8.00	invGraph after Narrowing: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 7 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 7 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.003241s
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.333627s
15.86/8.00	[54953 : 54987]
15.86/8.00	[54953 : 54988]
15.86/8.00	Successful child: 54987
15.86/8.00	[ Invariant Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 7 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ undef6 = 0 /\ 2*main_x + main_y = 7, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 7 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ undef6 = 1 /\ 2*main_x + main_y = 7, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	[ Termination Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	> It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 7 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 7 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ undef6 = 0 /\ 2*main_x + main_y = 7, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ undef6 = 1 /\ 2*main_x + main_y = 7, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	New Graphs: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ undef6 = 0 /\ 2*main_x + main_y = 7, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ undef6 = 1 /\ 2*main_x + main_y = 7, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.002591s
15.86/8.00	Ranking function: (~(21) / 2) + (7 / 2)*main_x
15.86/8.00	New Graphs: 
15.86/8.00	[54953 : 54992]
15.86/8.00	[54953 : 54993]
15.86/8.00	INVARIANTS: 
15.86/8.00	2: 
15.86/8.00	Quasi-INVARIANTS to narrow Graph: 
15.86/8.00	2: 2*main_x + main_y <= 7 , 
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 7 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 7 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 7 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 1
15.86/8.00	invGraph after Narrowing: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 8 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 8 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.003240s
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.424017s
15.86/8.00	[54953 : 54994]
15.86/8.00	[54953 : 54995]
15.86/8.00	Successful child: 54994
15.86/8.00	[ Invariant Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ main_y <= 4 + main_x /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 8 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ main_y <= 4 + main_x /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 8 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	[ Termination Graph ]
15.86/8.00	Strengthening and disabling transitions...
15.86/8.00	> It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 8 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ main_y <= 4 + main_x /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	Strengthening transition (result): 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ main_y <= 4 + main_x /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: CALL solverLinear in Graph for feasibility
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear in Graph for feasibility
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 8 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	New Graphs: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ main_y <= 4 + main_x /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ main_y <= 4 + main_x /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.003022s
15.86/8.00	Ranking function: -5 + main_x + main_y
15.86/8.00	New Graphs: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ main_y <= 4 + main_x /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.001561s
15.86/8.00	Ranking function: -1 + main_x
15.86/8.00	New Graphs: 
15.86/8.00	[54953 : 54999]
15.86/8.00	[54953 : 55000]
15.86/8.00	INVARIANTS: 
15.86/8.00	2: 
15.86/8.00	Quasi-INVARIANTS to narrow Graph: 
15.86/8.00	2: main_x <= 1 + main_y , main_y <= 4 + main_x , 
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 2
15.86/8.00	Narrowing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 8 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	
15.86/8.00	LOG: Narrow transition size 2
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x <= 1 + main_y /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	It's unfeasible. Removing transition: 
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 8 <= 2*main_x + main_y /\ undef6 = 1, {main_x -> -1 + main_x, main_y -> main_x, rest remain the same}>
15.86/8.00	invGraph after Narrowing: 
15.86/8.00	Transitions:
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 8 <= 2*main_x + main_y /\ 7 <= main_x + main_y /\ 5 + main_x <= main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 + main_y <= main_x /\ 4 <= main_x + main_y /\ 8 <= 2*main_x + main_y /\ undef6 = 0, {main_x -> -2 + main_y, main_y -> 1 + main_x, rest remain the same}>
15.86/8.00	Variables:
15.86/8.00	main_x, main_y
15.86/8.00	Checking conditional termination of SCC {l2}...
15.86/8.00	
15.86/8.00	LOG: CALL solveLinear
15.86/8.00	
15.86/8.00	LOG: RETURN solveLinear - Elapsed time: 0.002830s
15.86/8.00	Ranking function: (~(9) / 2) + main_x + main_y
15.86/8.00	New Graphs: 
15.86/8.00	Proving termination of subgraph 2
15.86/8.00	Analyzing SCC {l12}...
15.86/8.00	No cycles found.
15.86/8.00	
15.86/8.00	Program Terminates
15.86/8.00	EOF