0.00/0.45	YES
0.00/0.45	
0.00/0.45	Solver Timeout: 4
0.00/0.45	Global Timeout: 300
0.00/0.45	Maximum number of concurrent processes: 900
0.00/0.45	*******************************************************************************************
0.00/0.45	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.45	*******************************************************************************************
0.00/0.45	
0.00/0.45	
0.00/0.45	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.45	
0.00/0.45	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.45	+                                                                  +
0.00/0.45	Init Location: 0
0.00/0.45	Transitions:
0.00/0.45	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.45	<l1, l2, true>
0.00/0.45	<l2, l6, not((main_x > 0))>
0.00/0.45	<l2, l3, (main_x > 0)>
0.00/0.45	<l3, l6, not((main_x < main_y))>
0.00/0.45	<l3, l4, (main_x < main_y)>
0.00/0.45	<l4, l5, true, seq{main_x -> (2 * main_x), main_y -> (main_y + 1)}>
0.00/0.45	<l5, l2, true>
0.00/0.45	<l6, l7, true, seq{main__func_return_ -> 0}>
0.00/0.45	
0.00/0.45	Fresh variables:
0.00/0.45	
0.00/0.45	Undef variables:
0.00/0.45	
0.00/0.45	Abstraction variables:
0.00/0.45	
0.00/0.45	Exit nodes:
0.00/0.45	
0.00/0.45	Accepting locations:
0.00/0.45	
0.00/0.45	Asserts:
0.00/0.45	
0.00/0.45	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.45	       
0.00/0.45	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.45	       
0.00/0.45	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.45	
0.00/0.45	Init Location: 0
0.00/0.45	Transitions:
0.00/0.45	<l0, l8, true, seq{main__func_return_ -> 0}>
0.00/0.45	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.45	<l9, l10, true, seq{main_x -> varCall_1}>
0.00/0.45	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.45	<l11, l1, true, seq{main_y -> varCall_2}>
0.00/0.45	<l1, l2, true>
0.00/0.45	<l2, l3, (main_x > 0)>
0.00/0.45	<l2, l6, not((main_x > 0))>
0.00/0.45	<l3, l4, (main_x < main_y)>
0.00/0.45	<l3, l6, not((main_x < main_y))>
0.00/0.45	<l4, l5, true, seq{main_x -> (2 * main_x), main_y -> (main_y + 1)}>
0.00/0.45	<l5, l2, true>
0.00/0.45	<l6, l7, true, seq{main__func_return_ -> 0}>
0.00/0.45	
0.00/0.45	Fresh variables:
0.00/0.45	
0.00/0.45	Undef variables:
0.00/0.45	
0.00/0.45	Abstraction variables:
0.00/0.45	
0.00/0.45	Exit nodes:
0.00/0.45	7, 
0.00/0.45	Accepting locations:
0.00/0.45	
0.00/0.45	Asserts:
0.00/0.45	
0.00/0.45	+                                                                  +
0.00/0.45	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.45	
0.00/0.45	
0.00/0.45	Function Return and Parameters Information [2 functions]:
0.00/0.45	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.45	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.45	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.45	        main__func_return_      [function result] : int
0.00/0.45	
0.00/0.45	
0.00/0.45	AST Ident Scanner Information [4 idents]:
0.00/0.45	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9>
0.00/0.45	main | function | [integer, ()] | <line: 22, col: 1>
0.00/0.45	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 26, col: 21> <line: 27, col: 9> <line: 27, col: 15>
0.00/0.45	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 26, col: 25> <line: 28, col: 9> <line: 28, col: 13>
0.00/0.45	
0.00/0.45	Main function: main
0.00/0.45	Preprocessed LLVMGraph
0.00/0.45	Init Location: 0
0.00/0.45	Transitions:
0.00/0.45	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
0.00/0.45	<l2, l2, (main_x > 0) /\ (main_x < main_y), par{main_x -> (2 * main_x), main_y -> (main_y + 1)}>
0.00/0.45	<l2, l7, (main_x > 0) /\ not((main_x < main_y))>
0.00/0.45	<l2, l7, not((main_x > 0))>
0.00/0.45	
0.00/0.45	Fresh variables:
0.00/0.45	undef3, undef4, 
0.00/0.45	
0.00/0.45	Undef variables:
0.00/0.45	undef3, undef4, 
0.00/0.45	
0.00/0.45	Abstraction variables:
0.00/0.45	
0.00/0.45	Exit nodes:
0.00/0.45	7, 
0.00/0.45	Accepting locations:
0.00/0.45	
0.00/0.45	Asserts:
0.00/0.45	
0.00/0.45	*************************************************************
0.00/0.45	*******************************************************************************************
0.00/0.45	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.45	*******************************************************************************************
0.00/0.45	
0.00/0.45	Init Location: 0
0.00/0.45	Graph 0:
0.00/0.45	Transitions:
0.00/0.45	Variables:
0.00/0.45	
0.00/0.45	Graph 1:
0.00/0.45	Transitions:
0.00/0.45	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	Variables:
0.00/0.45	main_x, main_y
0.00/0.45	
0.00/0.45	Graph 2:
0.00/0.45	Transitions:
0.00/0.45	Variables:
0.00/0.45	
0.00/0.45	Precedence: 
0.00/0.45	Graph 0
0.00/0.45	
0.00/0.45	Graph 1
0.00/0.45	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.45	
0.00/0.45	Graph 2
0.00/0.45	<l2, l7, main_y <= main_x /\ 1 <= main_x, {all remain the same}>
0.00/0.45	<l2, l7, main_x <= 0, {all remain the same}>
0.00/0.45	
0.00/0.45	Map Locations to Subgraph:
0.00/0.45	( 0 , 0 )
0.00/0.45	( 2 , 1 )
0.00/0.45	( 7 , 2 )
0.00/0.45	
0.00/0.45	*******************************************************************************************
0.00/0.45	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.45	*******************************************************************************************
0.00/0.45	
0.00/0.45	Proving termination of subgraph 0
0.00/0.45	Proving termination of subgraph 1
0.00/0.45	Checking unfeasibility...
0.00/0.45	Time used: 0.002179
0.00/0.45	
0.00/0.45	Checking conditional termination of SCC {l2}...
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000619s
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.001840s
0.00/0.45	[13998 : 14000]
0.00/0.45	[13998 : 14001]
0.00/0.45	Successful child: 14000
0.00/0.45	[ Invariant Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	[ Termination Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	> It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	New Graphs: 
0.00/0.45	
0.00/0.45	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
0.00/0.45	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.45	* Postcondition  : 1 + main_x <= 0
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000480s
0.00/0.45	> Postcondition is not implied!
0.00/0.45	
0.00/0.45	LOG: RETURN check - Elapsed time: 0.000570s
0.00/0.45	INVARIANTS: 
0.00/0.45	2: 
0.00/0.45	Quasi-INVARIANTS to narrow Graph: 
0.00/0.45	2: 1 + main_x <= 0 , 
0.00/0.45	Narrowing transition: 
0.00/0.45	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	
0.00/0.45	LOG: Narrow transition size 1
0.00/0.45	invGraph after Narrowing: 
0.00/0.45	Transitions:
0.00/0.45	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	Variables:
0.00/0.45	main_x, main_y
0.00/0.45	Checking conditional termination of SCC {l2}...
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000591s
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.001968s
0.00/0.45	[13998 : 14005]
0.00/0.45	[13998 : 14006]
0.00/0.45	Successful child: 14005
0.00/0.45	[ Invariant Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	[ Termination Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	New Graphs: 
0.00/0.45	
0.00/0.45	LOG: CALL check - Post:main_x + main_y <= 1 - Process 2
0.00/0.45	* Exit transition: <l0, l2, 0 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.45	* Postcondition  : main_x + main_y <= 1
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000569s
0.00/0.45	> Postcondition is not implied!
0.00/0.45	
0.00/0.45	LOG: RETURN check - Elapsed time: 0.000667s
0.00/0.45	INVARIANTS: 
0.00/0.45	2: 
0.00/0.45	Quasi-INVARIANTS to narrow Graph: 
0.00/0.45	2: main_x + main_y <= 1 , 
0.00/0.45	Narrowing transition: 
0.00/0.45	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	
0.00/0.45	LOG: Narrow transition size 1
0.00/0.45	invGraph after Narrowing: 
0.00/0.45	Transitions:
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	Variables:
0.00/0.45	main_x, main_y
0.00/0.45	Checking conditional termination of SCC {l2}...
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000684s
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.002372s
0.00/0.45	[13998 : 14010]
0.00/0.45	[13998 : 14011]
0.00/0.45	Successful child: 14010
0.00/0.45	[ Invariant Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	[ Termination Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	New Graphs: 
0.00/0.45	
0.00/0.45	LOG: CALL check - Post:main_x <= 0 - Process 3
0.00/0.45	* Exit transition: <l0, l2, 0 <= main_x /\ 2 <= main_x + main_y /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.45	* Postcondition  : main_x <= 0
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000518s
0.00/0.45	> Postcondition is not implied!
0.00/0.45	
0.00/0.45	LOG: RETURN check - Elapsed time: 0.000624s
0.00/0.45	INVARIANTS: 
0.00/0.45	2: 
0.00/0.45	Quasi-INVARIANTS to narrow Graph: 
0.00/0.45	2: main_x <= 0 , 
0.00/0.45	Narrowing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	
0.00/0.45	LOG: Narrow transition size 1
0.00/0.45	invGraph after Narrowing: 
0.00/0.45	Transitions:
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	Variables:
0.00/0.45	main_x, main_y
0.00/0.45	Checking conditional termination of SCC {l2}...
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000689s
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.002370s
0.00/0.45	[13998 : 14015]
0.00/0.45	[13998 : 14016]
0.00/0.45	Successful child: 14015
0.00/0.45	[ Invariant Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	[ Termination Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	New Graphs: 
0.00/0.45	
0.00/0.45	LOG: CALL check - Post:main_y <= 1 - Process 4
0.00/0.45	* Exit transition: <l0, l2, 2 <= main_x + main_y /\ 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.45	* Postcondition  : main_y <= 1
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000517s
0.00/0.45	> Postcondition is not implied!
0.00/0.45	
0.00/0.45	LOG: RETURN check - Elapsed time: 0.000625s
0.00/0.45	INVARIANTS: 
0.00/0.45	2: 
0.00/0.45	Quasi-INVARIANTS to narrow Graph: 
0.00/0.45	2: main_y <= 1 , 
0.00/0.45	Narrowing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	
0.00/0.45	LOG: Narrow transition size 1
0.00/0.45	invGraph after Narrowing: 
0.00/0.45	Transitions:
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	Variables:
0.00/0.45	main_x, main_y
0.00/0.45	Checking conditional termination of SCC {l2}...
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000763s
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.002614s
0.00/0.45	[13998 : 14020]
0.00/0.45	[13998 : 14021]
0.00/0.45	Successful child: 14020
0.00/0.45	[ Invariant Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	[ Termination Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	> It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	New Graphs: 
0.00/0.45	
0.00/0.45	LOG: CALL check - Post:1 + main_y <= main_x - Process 5
0.00/0.45	* Exit transition: <l0, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.45	* Postcondition  : 1 + main_y <= main_x
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000582s
0.00/0.45	> Postcondition is not implied!
0.00/0.45	
0.00/0.45	LOG: RETURN check - Elapsed time: 0.000703s
0.00/0.45	INVARIANTS: 
0.00/0.45	2: 
0.00/0.45	Quasi-INVARIANTS to narrow Graph: 
0.00/0.45	2: 1 + main_y <= main_x , 
0.00/0.45	Narrowing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	
0.00/0.45	LOG: Narrow transition size 1
0.00/0.45	invGraph after Narrowing: 
0.00/0.45	Transitions:
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	Variables:
0.00/0.45	main_x, main_y
0.00/0.45	Checking conditional termination of SCC {l2}...
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000763s
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.002653s
0.00/0.45	[13998 : 14025]
0.00/0.45	[13998 : 14026]
0.00/0.45	Successful child: 14025
0.00/0.45	[ Invariant Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	[ Termination Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	> It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	New Graphs: 
0.00/0.45	
0.00/0.45	LOG: CALL check - Post:main_y <= main_x - Process 6
0.00/0.45	* Exit transition: <l0, l2, main_x <= main_y /\ 2 <= main_x + main_y /\ 2 <= main_y /\ 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.45	* Postcondition  : main_y <= main_x
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000641s
0.00/0.45	> Postcondition is not implied!
0.00/0.45	
0.00/0.45	LOG: RETURN check - Elapsed time: 0.000772s
0.00/0.45	INVARIANTS: 
0.00/0.45	2: 
0.00/0.45	Quasi-INVARIANTS to narrow Graph: 
0.00/0.45	2: main_y <= main_x , 
0.00/0.45	Narrowing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	
0.00/0.45	LOG: Narrow transition size 1
0.00/0.45	invGraph after Narrowing: 
0.00/0.45	Transitions:
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	Variables:
0.00/0.45	main_x, main_y
0.00/0.45	Checking conditional termination of SCC {l2}...
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000762s
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.002648s
0.00/0.45	[13998 : 14030]
0.00/0.45	[13998 : 14031]
0.00/0.45	Successful child: 14030
0.00/0.45	[ Invariant Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	Strengthening transition (result): 
0.00/0.45	<l2, l2, 2 <= main_x /\ 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	[ Termination Graph ]
0.00/0.45	Strengthening and disabling transitions...
0.00/0.45	
0.00/0.45	LOG: CALL solverLinear in Graph for feasibility
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.45	Strengthening transition (result): 
0.00/0.45	<l2, l2, 2 <= main_x /\ 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	Ranking function: -2*main_x + 2*main_y
0.00/0.45	New Graphs: 
0.00/0.45	
0.00/0.45	LOG: CALL check - Post:2 <= main_x - Process 7
0.00/0.45	* Exit transition: <l0, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.45	* Postcondition  : 2 <= main_x
0.00/0.45	
0.00/0.45	LOG: CALL solveLinear
0.00/0.45	
0.00/0.45	LOG: RETURN solveLinear - Elapsed time: 0.000514s
0.00/0.45	> Postcondition is not implied!
0.00/0.45	
0.00/0.45	LOG: RETURN check - Elapsed time: 0.000654s
0.00/0.45	INVARIANTS: 
0.00/0.45	2: 
0.00/0.45	Quasi-INVARIANTS to narrow Graph: 
0.00/0.45	2: 2 <= main_x , 
0.00/0.45	It's unfeasible. Removing transition: 
0.00/0.45	<l2, l2, 2 <= main_x + main_y /\ 2 <= main_y /\ 1 + main_x <= main_y /\ 1 <= main_x, {main_x -> 2*main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.45	invGraph after Narrowing: 
0.00/0.45	Transitions:
0.00/0.45	Variables:
0.00/0.45	main_x, main_y
0.00/0.45	Analyzing SCC {l2}...
0.00/0.45	No cycles found.
0.00/0.45	
0.00/0.45	Proving termination of subgraph 2
0.00/0.45	Analyzing SCC {l7}...
0.00/0.45	No cycles found.
0.00/0.45	
0.00/0.45	Program Terminates
0.00/0.45	EOF