36.40/12.41	NO
36.40/12.41	
36.40/12.41	Solver Timeout: 4
36.40/12.41	Global Timeout: 300
36.40/12.41	Maximum number of concurrent processes: 900
36.40/12.41	*******************************************************************************************
36.40/12.41	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
36.40/12.41	*******************************************************************************************
36.40/12.41	
36.40/12.41	
36.40/12.41	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
36.40/12.41	
36.40/12.41	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
36.40/12.41	+                                                                  +
36.40/12.41	Init Location: 0
36.40/12.41	Transitions:
36.40/12.41	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
36.40/12.41	<l1, l2, true>
36.40/12.41	<l2, l5, not((main_x < 5))>
36.40/12.41	<l2, l3, (main_x < 5)>
36.40/12.41	<l3, l4, true, seq{main_oldx -> main_x, main_x -> (main_oldx - main_y), main_y -> (main_oldx + main_y)}>
36.40/12.41	<l4, l2, true>
36.40/12.41	<l5, l6, true, seq{main__func_return_ -> 0}>
36.40/12.41	
36.40/12.41	Fresh variables:
36.40/12.41	
36.40/12.41	Undef variables:
36.40/12.41	
36.40/12.41	Abstraction variables:
36.40/12.41	
36.40/12.41	Exit nodes:
36.40/12.41	
36.40/12.41	Accepting locations:
36.40/12.41	
36.40/12.41	Asserts:
36.40/12.41	
36.40/12.41	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
36.40/12.41	       
36.40/12.41	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
36.40/12.41	       
36.40/12.41	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
36.40/12.41	
36.40/12.41	Init Location: 0
36.40/12.41	Transitions:
36.40/12.41	<l0, l7, true, seq{main__func_return_ -> 0}>
36.40/12.41	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
36.40/12.41	<l8, l9, true, seq{main_x -> varCall_1}>
36.40/12.41	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
36.40/12.41	<l10, l1, true, seq{main_y -> varCall_2}>
36.40/12.41	<l1, l2, true>
36.40/12.41	<l2, l3, (main_x < 5)>
36.40/12.41	<l2, l5, not((main_x < 5))>
36.40/12.41	<l3, l4, true, seq{main_oldx -> main_x, main_x -> (main_oldx - main_y), main_y -> (main_oldx + main_y)}>
36.40/12.41	<l4, l2, true>
36.40/12.41	<l5, l6, true, seq{main__func_return_ -> 0}>
36.40/12.41	
36.40/12.41	Fresh variables:
36.40/12.41	
36.40/12.41	Undef variables:
36.40/12.41	
36.40/12.41	Abstraction variables:
36.40/12.41	
36.40/12.41	Exit nodes:
36.40/12.41	6, 
36.40/12.41	Accepting locations:
36.40/12.41	
36.40/12.41	Asserts:
36.40/12.41	
36.40/12.41	+                                                                  +
36.40/12.41	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
36.40/12.41	
36.40/12.41	
36.40/12.41	Function Return and Parameters Information [2 functions]:
36.40/12.41	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
36.40/12.41	        __VERIFIER_nondet_int__func_return_      [function result] : int
36.40/12.41	    function name: main [1 return + 0 parameters]        demangled: main
36.40/12.41	        main__func_return_      [function result] : int
36.40/12.41	
36.40/12.41	
36.40/12.41	AST Ident Scanner Information [5 idents]:
36.40/12.41	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9>
36.40/12.41	main | function | [integer, ()] | <line: 22, col: 1>
36.40/12.41	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 27, col: 16> <line: 28, col: 9>
36.40/12.41	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 28, col: 20> <line: 29, col: 9> <line: 29, col: 20>
36.40/12.41	oldx | local variable | integer | <line: 23, col: 5> | <line: 27, col: 9> <line: 28, col: 13> <line: 29, col: 13>
36.40/12.41	
36.40/12.41	Main function: main
36.40/12.41	Preprocessed LLVMGraph
36.40/12.41	Init Location: 0
36.40/12.41	Transitions:
36.40/12.41	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
36.40/12.41	<l2, l2, (main_x < 5), par{main_x -> (main_x - main_y), main_y -> (main_x + main_y)}>
36.40/12.41	<l2, l6, not((main_x < 5))>
36.40/12.41	
36.40/12.41	Fresh variables:
36.40/12.41	undef3, undef4, 
36.40/12.41	
36.40/12.41	Undef variables:
36.40/12.41	undef3, undef4, 
36.40/12.41	
36.40/12.41	Abstraction variables:
36.40/12.41	
36.40/12.41	Exit nodes:
36.40/12.41	6, 
36.40/12.41	Accepting locations:
36.40/12.41	
36.40/12.41	Asserts:
36.40/12.41	
36.40/12.41	*************************************************************
36.40/12.41	*******************************************************************************************
36.40/12.41	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
36.40/12.41	*******************************************************************************************
36.40/12.41	
36.40/12.41	Init Location: 0
36.40/12.41	Graph 0:
36.40/12.41	Transitions:
36.40/12.41	Variables:
36.40/12.41	
36.40/12.41	Graph 1:
36.40/12.41	Transitions:
36.40/12.41	<l2, l2, main_x <= 4, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.41	Variables:
36.40/12.41	main_x, main_y
36.40/12.41	
36.40/12.41	Graph 2:
36.40/12.41	Transitions:
36.40/12.41	Variables:
36.40/12.41	
36.40/12.41	Precedence: 
36.40/12.41	Graph 0
36.40/12.41	
36.40/12.41	Graph 1
36.40/12.41	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
36.40/12.41	
36.40/12.41	Graph 2
36.40/12.41	<l2, l6, 5 <= main_x, {all remain the same}>
36.40/12.42	
36.40/12.42	Map Locations to Subgraph:
36.40/12.42	( 0 , 0 )
36.40/12.42	( 2 , 1 )
36.40/12.42	( 6 , 2 )
36.40/12.42	
36.40/12.42	*******************************************************************************************
36.40/12.42	********************************    CHECKING ASSERTIONS    ********************************
36.40/12.42	*******************************************************************************************
36.40/12.42	
36.40/12.42	Proving termination of subgraph 0
36.40/12.42	Proving termination of subgraph 1
36.40/12.42	Checking unfeasibility...
36.40/12.42	Time used: 0.00198
36.40/12.42	
36.40/12.42	Checking conditional termination of SCC {l2}...
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000762s
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.001757s
36.40/12.42	[19712 : 19714]
36.40/12.42	[19712 : 19715]
36.40/12.42	Successful child: 19714
36.40/12.42	[ Invariant Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	It's unfeasible. Removing transition: 
36.40/12.42	<l2, l2, main_x <= 4, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	[ Termination Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	It's unfeasible. Removing transition: 
36.40/12.42	<l2, l2, main_x <= 4, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	New Graphs: 
36.40/12.42	
36.40/12.42	LOG: CALL check - Post:5 <= main_x - Process 1
36.40/12.42	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
36.40/12.42	* Postcondition  : 5 <= main_x
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000470s
36.40/12.42	> Postcondition is not implied!
36.40/12.42	
36.40/12.42	LOG: RETURN check - Elapsed time: 0.000561s
36.40/12.42	INVARIANTS: 
36.40/12.42	2: 
36.40/12.42	Quasi-INVARIANTS to narrow Graph: 
36.40/12.42	2: 5 <= main_x , 
36.40/12.42	Narrowing transition: 
36.40/12.42	<l2, l2, main_x <= 4, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	
36.40/12.42	LOG: Narrow transition size 1
36.40/12.42	invGraph after Narrowing: 
36.40/12.42	Transitions:
36.40/12.42	<l2, l2, main_x <= 4, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Variables:
36.40/12.42	main_x, main_y
36.40/12.42	Checking conditional termination of SCC {l2}...
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000730s
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.001892s
36.40/12.42	[19712 : 19719]
36.40/12.42	[19712 : 19720]
36.40/12.42	Successful child: 19719
36.40/12.42	[ Invariant Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ 8 + main_y <= main_x, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	[ Termination Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ 8 + main_y <= main_x, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Ranking function: 4 - main_x
36.40/12.42	New Graphs: 
36.40/12.42	
36.40/12.42	LOG: CALL check - Post:8 + main_y <= main_x - Process 2
36.40/12.42	* Exit transition: <l0, l2, main_x <= 4 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
36.40/12.42	* Postcondition  : 8 + main_y <= main_x
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000565s
36.40/12.42	> Postcondition is not implied!
36.40/12.42	
36.40/12.42	LOG: RETURN check - Elapsed time: 0.000668s
36.40/12.42	INVARIANTS: 
36.40/12.42	2: 
36.40/12.42	Quasi-INVARIANTS to narrow Graph: 
36.40/12.42	2: 8 + main_y <= main_x , 
36.40/12.42	Narrowing transition: 
36.40/12.42	<l2, l2, main_x <= 4, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	
36.40/12.42	LOG: Narrow transition size 1
36.40/12.42	invGraph after Narrowing: 
36.40/12.42	Transitions:
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Variables:
36.40/12.42	main_x, main_y
36.40/12.42	Checking conditional termination of SCC {l2}...
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000610s
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.002031s
36.40/12.42	[19712 : 19724]
36.40/12.42	[19712 : 19725]
36.40/12.42	Successful child: 19724
36.40/12.42	[ Invariant Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ 7 + main_y <= 0 /\ main_x <= 7 + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	[ Termination Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ 7 + main_y <= 0 /\ main_x <= 7 + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Ranking function: 4 - main_x
36.40/12.42	New Graphs: 
36.40/12.42	
36.40/12.42	LOG: CALL check - Post:7 + main_y <= 0 - Process 3
36.40/12.42	* Exit transition: <l0, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
36.40/12.42	* Postcondition  : 7 + main_y <= 0
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000607s
36.40/12.42	> Postcondition is not implied!
36.40/12.42	
36.40/12.42	LOG: RETURN check - Elapsed time: 0.000713s
36.40/12.42	INVARIANTS: 
36.40/12.42	2: 
36.40/12.42	Quasi-INVARIANTS to narrow Graph: 
36.40/12.42	2: 7 + main_y <= 0 , 
36.40/12.42	Narrowing transition: 
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	
36.40/12.42	LOG: Narrow transition size 1
36.40/12.42	invGraph after Narrowing: 
36.40/12.42	Transitions:
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Variables:
36.40/12.42	main_x, main_y
36.40/12.42	Checking conditional termination of SCC {l2}...
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000675s
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.002315s
36.40/12.42	[19712 : 19729]
36.40/12.42	[19712 : 19730]
36.40/12.42	Successful child: 19729
36.40/12.42	[ Invariant Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 12 + main_x + main_y <= 0, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	[ Termination Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 12 + main_x + main_y <= 0, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Ranking function: 6 + main_y
36.40/12.42	New Graphs: 
36.40/12.42	
36.40/12.42	LOG: CALL check - Post:12 + main_x + main_y <= 0 - Process 4
36.40/12.42	* Exit transition: <l0, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
36.40/12.42	* Postcondition  : 12 + main_x + main_y <= 0
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000683s
36.40/12.42	> Postcondition is not implied!
36.40/12.42	
36.40/12.42	LOG: RETURN check - Elapsed time: 0.000805s
36.40/12.42	INVARIANTS: 
36.40/12.42	2: 
36.40/12.42	Quasi-INVARIANTS to narrow Graph: 
36.40/12.42	2: 12 + main_x + main_y <= 0 , 
36.40/12.42	Narrowing transition: 
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	
36.40/12.42	LOG: Narrow transition size 1
36.40/12.42	invGraph after Narrowing: 
36.40/12.42	Transitions:
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Variables:
36.40/12.42	main_x, main_y
36.40/12.42	Checking conditional termination of SCC {l2}...
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000757s
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.002612s
36.40/12.42	[19712 : 19734]
36.40/12.42	[19712 : 19735]
36.40/12.42	Successful child: 19734
36.40/12.42	[ Invariant Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 11 + main_x <= 0 /\ 0 <= 11 + main_x + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	[ Termination Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 11 + main_x <= 0 /\ 0 <= 11 + main_x + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Ranking function: 14 + main_y
36.40/12.42	New Graphs: 
36.40/12.42	
36.40/12.42	LOG: CALL check - Post:11 + main_x <= 0 - Process 5
36.40/12.42	* Exit transition: <l0, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
36.40/12.42	* Postcondition  : 11 + main_x <= 0
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000620s
36.40/12.42	> Postcondition is not implied!
36.40/12.42	
36.40/12.42	LOG: RETURN check - Elapsed time: 0.000755s
36.40/12.42	INVARIANTS: 
36.40/12.42	2: 
36.40/12.42	Quasi-INVARIANTS to narrow Graph: 
36.40/12.42	2: 11 + main_x <= 0 , 
36.40/12.42	Narrowing transition: 
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	
36.40/12.42	LOG: Narrow transition size 1
36.40/12.42	invGraph after Narrowing: 
36.40/12.42	Transitions:
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Variables:
36.40/12.42	main_x, main_y
36.40/12.42	Checking conditional termination of SCC {l2}...
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000832s
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.002853s
36.40/12.42	[19712 : 19739]
36.40/12.42	[19712 : 19740]
36.40/12.42	Successful child: 19739
36.40/12.42	[ Invariant Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x /\ 20 + main_x <= main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	[ Termination Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x /\ 20 + main_x <= main_y, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Ranking function: 10 + main_x
36.40/12.42	New Graphs: 
36.40/12.42	
36.40/12.42	LOG: CALL check - Post:20 + main_x <= main_y - Process 6
36.40/12.42	* Exit transition: <l0, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
36.40/12.42	* Postcondition  : 20 + main_x <= main_y
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000663s
36.40/12.42	> Postcondition is not implied!
36.40/12.42	
36.40/12.42	LOG: RETURN check - Elapsed time: 0.000809s
36.40/12.42	INVARIANTS: 
36.40/12.42	2: 
36.40/12.42	Quasi-INVARIANTS to narrow Graph: 
36.40/12.42	2: 20 + main_x <= main_y , 
36.40/12.42	Narrowing transition: 
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	
36.40/12.42	LOG: Narrow transition size 1
36.40/12.42	invGraph after Narrowing: 
36.40/12.42	Transitions:
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x /\ main_y <= 19 + main_x, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Variables:
36.40/12.42	main_x, main_y
36.40/12.42	Checking conditional termination of SCC {l2}...
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000917s
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.003257s
36.40/12.42	[19712 : 19744]
36.40/12.42	[19712 : 19745]
36.40/12.42	Successful child: 19744
36.40/12.42	[ Invariant Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x /\ 19 <= main_y /\ main_y <= 19 + main_x, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	[ Termination Graph ]
36.40/12.42	Strengthening and disabling transitions...
36.40/12.42	
36.40/12.42	LOG: CALL solverLinear in Graph for feasibility
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear in Graph for feasibility
36.40/12.42	Strengthening transition (result): 
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x /\ 19 <= main_y /\ main_y <= 19 + main_x, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Ranking function: 14 + main_x
36.40/12.42	New Graphs: 
36.40/12.42	
36.40/12.42	LOG: CALL check - Post:19 <= main_y - Process 7
36.40/12.42	* Exit transition: <l0, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x /\ main_y <= 19 + main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
36.40/12.42	* Postcondition  : 19 <= main_y
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000712s
36.40/12.42	> Postcondition is not implied!
36.40/12.42	
36.40/12.42	LOG: RETURN check - Elapsed time: 0.000860s
36.40/12.42	INVARIANTS: 
36.40/12.42	2: 
36.40/12.42	Quasi-INVARIANTS to narrow Graph: 
36.40/12.42	2: 19 <= main_y , 
36.40/12.42	Narrowing transition: 
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x /\ main_y <= 19 + main_x, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	
36.40/12.42	LOG: Narrow transition size 1
36.40/12.42	invGraph after Narrowing: 
36.40/12.42	Transitions:
36.40/12.42	<l2, l2, main_x <= 4 /\ main_x <= 7 + main_y /\ 0 <= 6 + main_y /\ 0 <= 11 + main_x + main_y /\ 0 <= 10 + main_x /\ main_y <= 19 + main_x /\ main_y <= 18, {main_x -> main_x - main_y, main_y -> main_x + main_y, rest remain the same}>
36.40/12.42	Variables:
36.40/12.42	main_x, main_y
36.40/12.42	Checking conditional termination of SCC {l2}...
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.000996s
36.40/12.42	
36.40/12.42	LOG: CALL solveLinear
36.40/12.42	
36.40/12.42	LOG: RETURN solveLinear - Elapsed time: 0.003531s
36.40/12.42	[19712 : 19749]
36.40/12.42	[19712 : 19750]
36.40/12.42	Solving with 1 template(s).
36.40/12.42	
36.40/12.42	LOG: CALL solveNonLinearGetFirstSolution
36.40/12.42	
36.40/12.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007672s
36.40/12.42	Time used: 0.007196
36.40/12.42	
36.40/12.42	[19712 : 19754]
36.40/12.42	[19712 : 19758]
36.40/12.42	Successful child: 19754
36.40/12.42	
36.40/12.42	Program does NOT terminate
36.40/12.42	EOF