46.74/20.99	NO
46.74/20.99	
46.74/20.99	Solver Timeout: 4
46.74/20.99	Global Timeout: 300
46.74/20.99	Maximum number of concurrent processes: 900
46.74/20.99	*******************************************************************************************
46.74/20.99	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
46.74/20.99	*******************************************************************************************
46.74/20.99	
46.74/20.99	
46.74/20.99	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
46.74/20.99	
46.74/20.99	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
46.74/20.99	+                                                                  +
46.74/20.99	Init Location: 0
46.74/20.99	Transitions:
46.74/20.99	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
46.74/20.99	<l1, l2, true>
46.74/20.99	<l2, l5, not((main_x < 0))>
46.74/20.99	<l2, l3, (main_x < 0)>
46.74/20.99	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y - 1)}>
46.74/20.99	<l4, l2, true>
46.74/20.99	<l5, l6, true, seq{main__func_return_ -> 0}>
46.74/20.99	
46.74/20.99	Fresh variables:
46.74/20.99	
46.74/20.99	Undef variables:
46.74/20.99	
46.74/20.99	Abstraction variables:
46.74/20.99	
46.74/20.99	Exit nodes:
46.74/20.99	
46.74/20.99	Accepting locations:
46.74/20.99	
46.74/20.99	Asserts:
46.74/20.99	
46.74/20.99	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
46.74/20.99	       
46.74/20.99	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
46.74/20.99	       
46.74/20.99	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
46.74/20.99	
46.74/20.99	Init Location: 0
46.74/20.99	Transitions:
46.74/20.99	<l0, l7, true, seq{main__func_return_ -> 0}>
46.74/20.99	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
46.74/20.99	<l8, l9, true, seq{main_x -> varCall_1}>
46.74/20.99	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
46.74/20.99	<l10, l1, true, seq{main_y -> varCall_2}>
46.74/20.99	<l1, l2, true>
46.74/20.99	<l2, l3, (main_x < 0)>
46.74/20.99	<l2, l5, not((main_x < 0))>
46.74/20.99	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y - 1)}>
46.74/20.99	<l4, l2, true>
46.74/20.99	<l5, l6, true, seq{main__func_return_ -> 0}>
46.74/20.99	
46.74/20.99	Fresh variables:
46.74/20.99	
46.74/20.99	Undef variables:
46.74/20.99	
46.74/20.99	Abstraction variables:
46.74/20.99	
46.74/20.99	Exit nodes:
46.74/20.99	6, 
46.74/20.99	Accepting locations:
46.74/20.99	
46.74/20.99	Asserts:
46.74/20.99	
46.74/20.99	+                                                                  +
46.74/20.99	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
46.74/20.99	
46.74/20.99	
46.74/20.99	Function Return and Parameters Information [2 functions]:
46.74/20.99	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
46.74/20.99	        __VERIFIER_nondet_int__func_return_      [function result] : int
46.74/20.99	    function name: main [1 return + 0 parameters]        demangled: main
46.74/20.99	        main__func_return_      [function result] : int
46.74/20.99	
46.74/20.99	
46.74/20.99	AST Ident Scanner Information [4 idents]:
46.74/20.99	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9>
46.74/20.99	main | function | [integer, ()] | <line: 22, col: 1>
46.74/20.99	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 27, col: 9> <line: 27, col: 13>
46.74/20.99	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 27, col: 17> <line: 28, col: 9> <line: 28, col: 13>
46.74/20.99	
46.74/20.99	Main function: main
46.74/20.99	Preprocessed LLVMGraph
46.74/20.99	Init Location: 0
46.74/20.99	Transitions:
46.74/20.99	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
46.74/20.99	<l2, l2, (main_x < 0), par{main_x -> (main_x + main_y), main_y -> (main_y - 1)}>
46.74/20.99	<l2, l6, not((main_x < 0))>
46.74/21.00	
46.74/21.00	Fresh variables:
46.74/21.00	undef3, undef4, 
46.74/21.00	
46.74/21.00	Undef variables:
46.74/21.00	undef3, undef4, 
46.74/21.00	
46.74/21.00	Abstraction variables:
46.74/21.00	
46.74/21.00	Exit nodes:
46.74/21.00	6, 
46.74/21.00	Accepting locations:
46.74/21.00	
46.74/21.00	Asserts:
46.74/21.00	
46.74/21.00	*************************************************************
46.74/21.00	*******************************************************************************************
46.74/21.00	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
46.74/21.00	*******************************************************************************************
46.74/21.00	
46.74/21.00	Init Location: 0
46.74/21.00	Graph 0:
46.74/21.00	Transitions:
46.74/21.00	Variables:
46.74/21.00	
46.74/21.00	Graph 1:
46.74/21.00	Transitions:
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Variables:
46.74/21.00	main_x, main_y
46.74/21.00	
46.74/21.00	Graph 2:
46.74/21.00	Transitions:
46.74/21.00	Variables:
46.74/21.00	
46.74/21.00	Precedence: 
46.74/21.00	Graph 0
46.74/21.00	
46.74/21.00	Graph 1
46.74/21.00	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.74/21.00	
46.74/21.00	Graph 2
46.74/21.00	<l2, l6, 0 <= main_x, {all remain the same}>
46.74/21.00	
46.74/21.00	Map Locations to Subgraph:
46.74/21.00	( 0 , 0 )
46.74/21.00	( 2 , 1 )
46.74/21.00	( 6 , 2 )
46.74/21.00	
46.74/21.00	*******************************************************************************************
46.74/21.00	********************************    CHECKING ASSERTIONS    ********************************
46.74/21.00	*******************************************************************************************
46.74/21.00	
46.74/21.00	Proving termination of subgraph 0
46.74/21.00	Proving termination of subgraph 1
46.74/21.00	Checking unfeasibility...
46.74/21.00	Time used: 0.001917
46.74/21.00	
46.74/21.00	Checking conditional termination of SCC {l2}...
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000492s
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.001346s
46.74/21.00	[43744 : 43746]
46.74/21.00	[43744 : 43747]
46.74/21.00	Successful child: 43746
46.74/21.00	[ Invariant Graph ]
46.74/21.00	Strengthening and disabling transitions...
46.74/21.00	
46.74/21.00	LOG: CALL solverLinear in Graph for feasibility
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear in Graph for feasibility
46.74/21.00	It's unfeasible. Removing transition: 
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	[ Termination Graph ]
46.74/21.00	Strengthening and disabling transitions...
46.74/21.00	> It's unfeasible. Removing transition: 
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	New Graphs: 
46.74/21.00	
46.74/21.00	LOG: CALL check - Post:1 <= main_x - Process 1
46.74/21.00	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.74/21.00	* Postcondition  : 1 <= main_x
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000480s
46.74/21.00	> Postcondition is not implied!
46.74/21.00	
46.74/21.00	LOG: RETURN check - Elapsed time: 0.000574s
46.74/21.00	INVARIANTS: 
46.74/21.00	2: 
46.74/21.00	Quasi-INVARIANTS to narrow Graph: 
46.74/21.00	2: 1 <= main_x , 
46.74/21.00	Narrowing transition: 
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	
46.74/21.00	LOG: Narrow transition size 1
46.74/21.00	invGraph after Narrowing: 
46.74/21.00	Transitions:
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Variables:
46.74/21.00	main_x, main_y
46.74/21.00	Checking conditional termination of SCC {l2}...
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000475s
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.001495s
46.74/21.00	[43744 : 43751]
46.74/21.00	[43744 : 43752]
46.74/21.00	Successful child: 43751
46.74/21.00	[ Invariant Graph ]
46.74/21.00	Strengthening and disabling transitions...
46.74/21.00	
46.74/21.00	LOG: CALL solverLinear in Graph for feasibility
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear in Graph for feasibility
46.74/21.00	It's unfeasible. Removing transition: 
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	[ Termination Graph ]
46.74/21.00	Strengthening and disabling transitions...
46.74/21.00	> It's unfeasible. Removing transition: 
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	New Graphs: 
46.74/21.00	
46.74/21.00	LOG: CALL check - Post:0 <= main_x - Process 2
46.74/21.00	* Exit transition: <l0, l2, main_x <= 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.74/21.00	* Postcondition  : 0 <= main_x
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000573s
46.74/21.00	> Postcondition is not implied!
46.74/21.00	
46.74/21.00	LOG: RETURN check - Elapsed time: 0.000668s
46.74/21.00	INVARIANTS: 
46.74/21.00	2: 
46.74/21.00	Quasi-INVARIANTS to narrow Graph: 
46.74/21.00	2: 0 <= main_x , 
46.74/21.00	Narrowing transition: 
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	
46.74/21.00	LOG: Narrow transition size 1
46.74/21.00	invGraph after Narrowing: 
46.74/21.00	Transitions:
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Variables:
46.74/21.00	main_x, main_y
46.74/21.00	Checking conditional termination of SCC {l2}...
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000463s
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.001472s
46.74/21.00	[43744 : 43756]
46.74/21.00	[43744 : 43757]
46.74/21.00	Successful child: 43756
46.74/21.00	[ Invariant Graph ]
46.74/21.00	Strengthening and disabling transitions...
46.74/21.00	
46.74/21.00	LOG: CALL solverLinear in Graph for feasibility
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear in Graph for feasibility
46.74/21.00	Strengthening transition (result): 
46.74/21.00	<l2, l2, 0 <= main_x + main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	[ Termination Graph ]
46.74/21.00	Strengthening and disabling transitions...
46.74/21.00	
46.74/21.00	LOG: CALL solverLinear in Graph for feasibility
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear in Graph for feasibility
46.74/21.00	Strengthening transition (result): 
46.74/21.00	<l2, l2, 0 <= main_x + main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Ranking function: main_y
46.74/21.00	New Graphs: 
46.74/21.00	
46.74/21.00	LOG: CALL check - Post:0 <= main_x + main_y - Process 3
46.74/21.00	* Exit transition: <l0, l2, 1 + main_x <= 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.74/21.00	* Postcondition  : 0 <= main_x + main_y
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000530s
46.74/21.00	> Postcondition is not implied!
46.74/21.00	
46.74/21.00	LOG: RETURN check - Elapsed time: 0.000631s
46.74/21.00	INVARIANTS: 
46.74/21.00	2: 
46.74/21.00	Quasi-INVARIANTS to narrow Graph: 
46.74/21.00	2: 0 <= main_x + main_y , 
46.74/21.00	Narrowing transition: 
46.74/21.00	<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	
46.74/21.00	LOG: Narrow transition size 1
46.74/21.00	invGraph after Narrowing: 
46.74/21.00	Transitions:
46.74/21.00	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_y <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Variables:
46.74/21.00	main_x, main_y
46.74/21.00	Checking conditional termination of SCC {l2}...
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000567s
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.001948s
46.74/21.00	[43744 : 43761]
46.74/21.00	[43744 : 43762]
46.74/21.00	Solving with 1 template(s).
46.74/21.00	
46.74/21.00	LOG: CALL solveNonLinearGetFirstSolution
46.74/21.00	
46.74/21.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007075s
46.74/21.00	Time used: 0.006663
46.74/21.00	Improving Solution with cost 1 ...
46.74/21.00	
46.74/21.00	LOG: CALL solveNonLinearGetNextSolution
46.74/21.00	
46.74/21.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016287s
46.74/21.00	Time used: 0.016283
46.74/21.00	
46.74/21.00	LOG: SAT solveNonLinear - Elapsed time: 0.023363s
46.74/21.00	Cost: 1; Total time: 0.022946
46.74/21.00	Quasi-ranking function: 50000 + main_y
46.74/21.00	New Graphs: 
46.74/21.00	Transitions:
46.74/21.00	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 50001 + main_y <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Variables:
46.74/21.00	main_x, main_y
46.74/21.00	Checking conditional termination of SCC {l2}...
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000615s
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.002690s
46.74/21.00	[43744 : 43766]
46.74/21.00	[43744 : 43767]
46.74/21.00	Solving with 1 template(s).
46.74/21.00	
46.74/21.00	LOG: CALL solveNonLinearGetFirstSolution
46.74/21.00	
46.74/21.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008533s
46.74/21.00	Time used: 0.008083
46.74/21.00	Improving Solution with cost 1 ...
46.74/21.00	
46.74/21.00	LOG: CALL solveNonLinearGetNextSolution
46.74/21.00	
46.74/21.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015240s
46.74/21.00	Time used: 0.015237
46.74/21.00	
46.74/21.00	LOG: SAT solveNonLinear - Elapsed time: 0.023774s
46.74/21.00	Cost: 1; Total time: 0.02332
46.74/21.00	Quasi-ranking function: 50000 + main_x + 2*main_y
46.74/21.00	New Graphs: 
46.74/21.00	Transitions:
46.74/21.00	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 50001 + main_x + 2*main_y <= 0 /\ 50001 + main_y <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Variables:
46.74/21.00	main_x, main_y
46.74/21.00	Checking conditional termination of SCC {l2}...
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000726s
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.004798s
46.74/21.00	[43744 : 43771]
46.74/21.00	[43744 : 43772]
46.74/21.00	Solving with 1 template(s).
46.74/21.00	
46.74/21.00	LOG: CALL solveNonLinearGetFirstSolution
46.74/21.00	
46.74/21.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011524s
46.74/21.00	Time used: 0.010982
46.74/21.00	Improving Solution with cost 1 ...
46.74/21.00	
46.74/21.00	LOG: CALL solveNonLinearGetNextSolution
46.74/21.00	
46.74/21.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017823s
46.74/21.00	Time used: 0.017818
46.74/21.00	
46.74/21.00	LOG: SAT solveNonLinear - Elapsed time: 0.029347s
46.74/21.00	Cost: 1; Total time: 0.0288
46.74/21.00	Termination implied by a set of invariant(s):
46.74/21.00	Invariant at l2: main_x <= 0
46.74/21.00	[ Invariant Graph ]
46.74/21.00	Strengthening and disabling transitions...
46.74/21.00	
46.74/21.00	LOG: CALL solverLinear in Graph for feasibility
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear in Graph for feasibility
46.74/21.00	Strengthening transition (result): 
46.74/21.00	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_y <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	[ Termination Graph ]
46.74/21.00	Strengthening and disabling transitions...
46.74/21.00	
46.74/21.00	LOG: CALL solverLinear in Graph for feasibility
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear in Graph for feasibility
46.74/21.00	Strengthening transition (result): 
46.74/21.00	<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 50001 + main_x + 2*main_y <= 0 /\ 50001 + main_y <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Quasi-ranking function: 50000 + main_x
46.74/21.00	New Graphs: 
46.74/21.00	Transitions:
46.74/21.00	<l2, l2, 1 + main_x + main_y <= 0 /\ 50001 + main_x <= 0 /\ 50001 + main_x + 2*main_y <= 0 /\ 50001 + main_y <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Variables:
46.74/21.00	main_x, main_y
46.74/21.00	Checking conditional termination of SCC {l2}...
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000720s
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.008163s
46.74/21.00	[43744 : 43776]
46.74/21.00	[43744 : 43777]
46.74/21.00	Solving with 1 template(s).
46.74/21.00	
46.74/21.00	LOG: CALL solveNonLinearGetFirstSolution
46.74/21.00	
46.74/21.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010312s
46.74/21.00	Time used: 0.009759
46.74/21.00	Improving Solution with cost 1 ...
46.74/21.00	
46.74/21.00	LOG: CALL solveNonLinearGetNextSolution
46.74/21.00	
46.74/21.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017171s
46.74/21.00	Time used: 0.017167
46.74/21.00	
46.74/21.00	LOG: SAT solveNonLinear - Elapsed time: 0.027483s
46.74/21.00	Cost: 1; Total time: 0.026926
46.74/21.00	Quasi-ranking function: 50000 + main_x - main_y
46.74/21.00	New Graphs: 
46.74/21.00	Transitions:
46.74/21.00	<l2, l2, 1 + main_x + main_y <= 0 /\ 50001 + main_x <= 0 /\ 50001 + main_x <= main_y /\ 50001 + main_x + 2*main_y <= 0 /\ 50001 + main_y <= 0, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
46.74/21.00	Variables:
46.74/21.00	main_x, main_y
46.74/21.00	Checking conditional termination of SCC {l2}...
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.000897s
46.74/21.00	
46.74/21.00	LOG: CALL solveLinear
46.74/21.00	
46.74/21.00	LOG: RETURN solveLinear - Elapsed time: 0.004473s
46.74/21.00	[43744 : 43781]
46.74/21.00	[43744 : 43782]
46.74/21.00	Solving with 1 template(s).
46.74/21.00	
46.74/21.00	LOG: CALL solveNonLinearGetFirstSolution
46.74/21.00	
46.74/21.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011521s
46.74/21.00	Time used: 0.011074
46.74/21.00	
46.74/21.00	[43744 : 43786]
46.74/21.00	[43744 : 43790]
46.74/21.00	Successful child: 43786
46.74/21.00	
46.74/21.00	Program does NOT terminate
46.74/21.00	EOF