8.30/2.83	YES
8.30/2.83	
8.30/2.83	Solver Timeout: 4
8.30/2.83	Global Timeout: 300
8.30/2.83	Maximum number of concurrent processes: 900
8.30/2.83	*******************************************************************************************
8.30/2.83	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
8.30/2.83	*******************************************************************************************
8.30/2.83	
8.30/2.83	
8.30/2.83	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
8.30/2.83	
8.30/2.83	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
8.30/2.83	+                                                                  +
8.30/2.83	Init Location: 0
8.30/2.83	Transitions:
8.30/2.83	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int)}>
8.30/2.83	<l1, l2, true>
8.30/2.83	<l2, l6, not(((main_x + main_y) >= 0))>
8.30/2.83	<l2, l3, ((main_x + main_y) >= 0)>
8.30/2.83	<l3, l6, not((main_x <= main_n))>
8.30/2.83	<l3, l4, (main_x <= main_n)>
8.30/2.83	<l4, l5, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> main_z, main_z -> (main_z + 1)}>
8.30/2.83	<l5, l2, true>
8.30/2.83	<l6, l7, true, seq{main__func_return_ -> 0}>
8.30/2.83	
8.30/2.83	Fresh variables:
8.30/2.83	
8.30/2.83	Undef variables:
8.30/2.83	
8.30/2.83	Abstraction variables:
8.30/2.83	
8.30/2.83	Exit nodes:
8.30/2.83	
8.30/2.83	Accepting locations:
8.30/2.83	
8.30/2.83	Asserts:
8.30/2.83	
8.30/2.83	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
8.30/2.83	       
8.30/2.83	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
8.30/2.83	       
8.30/2.83	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
8.30/2.83	
8.30/2.83	Init Location: 0
8.30/2.83	Transitions:
8.30/2.83	<l0, l8, true, seq{main__func_return_ -> 0}>
8.30/2.83	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
8.30/2.83	<l9, l10, true, seq{main_x -> varCall_1}>
8.30/2.83	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
8.30/2.83	<l11, l12, true, seq{main_y -> varCall_2}>
8.30/2.83	<l12, l13, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
8.30/2.83	<l13, l14, true, seq{main_z -> varCall_3}>
8.30/2.83	<l14, l15, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
8.30/2.83	<l15, l1, true, seq{main_n -> varCall_4}>
8.30/2.83	<l1, l2, true>
8.30/2.83	<l2, l3, ((main_x + main_y) >= 0)>
8.30/2.84	<l2, l6, not(((main_x + main_y) >= 0))>
8.30/2.84	<l3, l4, (main_x <= main_n)>
8.30/2.84	<l3, l6, not((main_x <= main_n))>
8.30/2.84	<l4, l5, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> main_z, main_z -> (main_z + 1)}>
8.30/2.84	<l5, l2, true>
8.30/2.84	<l6, l7, true, seq{main__func_return_ -> 0}>
8.30/2.84	
8.30/2.84	Fresh variables:
8.30/2.84	
8.30/2.84	Undef variables:
8.30/2.84	
8.30/2.84	Abstraction variables:
8.30/2.84	
8.30/2.84	Exit nodes:
8.30/2.84	7, 
8.30/2.84	Accepting locations:
8.30/2.84	
8.30/2.84	Asserts:
8.30/2.84	
8.30/2.84	+                                                                  +
8.30/2.84	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
8.30/2.84	
8.30/2.84	
8.30/2.84	Function Return and Parameters Information [2 functions]:
8.30/2.84	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
8.30/2.84	        __VERIFIER_nondet_int__func_return_      [function result] : int
8.30/2.84	    function name: main [1 return + 0 parameters]        demangled: main
8.30/2.84	        main__func_return_      [function result] : int
8.30/2.84	
8.30/2.84	
8.30/2.84	AST Ident Scanner Information [6 idents]:
8.30/2.84	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9> <line: 27, col: 9>
8.30/2.84	main | function | [integer, ()] | <line: 22, col: 1>
8.30/2.84	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 28, col: 12> <line: 28, col: 26> <line: 29, col: 9> <line: 29, col: 15>
8.30/2.84	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 28, col: 16> <line: 29, col: 19> <line: 30, col: 9>
8.30/2.84	z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 30, col: 13> <line: 31, col: 9> <line: 31, col: 13> <line: 32, col: 9> <line: 32, col: 13>
8.30/2.84	n | local variable | integer | <line: 23, col: 5> | <line: 27, col: 5> <line: 28, col: 31>
8.30/2.84	
8.30/2.84	Main function: main
8.30/2.84	Preprocessed LLVMGraph
8.30/2.84	Init Location: 0
8.30/2.84	Transitions:
8.30/2.84	<l0, l2, (main_x = undef5) /\ (main_y = undef6) /\ (main_z = undef7) /\ (main_n = undef8)>
8.30/2.84	<l2, l2, ((main_x + main_y) >= 0) /\ (main_x <= main_n), par{main_x -> ((2 * main_x) + main_y), main_y -> main_z, main_z -> (main_z + 1)}>
8.30/2.84	<l2, l7, ((main_x + main_y) >= 0) /\ not((main_x <= main_n))>
8.30/2.84	<l2, l7, not(((main_x + main_y) >= 0))>
8.30/2.84	
8.30/2.84	Fresh variables:
8.30/2.84	undef5, undef6, undef7, undef8, 
8.30/2.84	
8.30/2.84	Undef variables:
8.30/2.84	undef5, undef6, undef7, undef8, 
8.30/2.84	
8.30/2.84	Abstraction variables:
8.30/2.84	
8.30/2.84	Exit nodes:
8.30/2.84	7, 
8.30/2.84	Accepting locations:
8.30/2.84	
8.30/2.84	Asserts:
8.30/2.84	
8.30/2.84	*************************************************************
8.30/2.84	*******************************************************************************************
8.30/2.84	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
8.30/2.84	*******************************************************************************************
8.30/2.84	
8.30/2.84	Init Location: 0
8.30/2.84	Graph 0:
8.30/2.84	Transitions:
8.30/2.84	Variables:
8.30/2.84	
8.30/2.84	Graph 1:
8.30/2.84	Transitions:
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Variables:
8.30/2.84	main_x, main_y, main_z, main_n
8.30/2.84	
8.30/2.84	Graph 2:
8.30/2.84	Transitions:
8.30/2.84	Variables:
8.30/2.84	
8.30/2.84	Precedence: 
8.30/2.84	Graph 0
8.30/2.84	
8.30/2.84	Graph 1
8.30/2.84	<l0, l2, main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
8.30/2.84	
8.30/2.84	Graph 2
8.30/2.84	<l2, l7, 0 <= main_x + main_y /\ 1 + main_n <= main_x, {all remain the same}>
8.30/2.84	<l2, l7, 1 + main_x + main_y <= 0, {all remain the same}>
8.30/2.84	
8.30/2.84	Map Locations to Subgraph:
8.30/2.84	( 0 , 0 )
8.30/2.84	( 2 , 1 )
8.30/2.84	( 7 , 2 )
8.30/2.84	
8.30/2.84	*******************************************************************************************
8.30/2.84	********************************    CHECKING ASSERTIONS    ********************************
8.30/2.84	*******************************************************************************************
8.30/2.84	
8.30/2.84	Proving termination of subgraph 0
8.30/2.84	Proving termination of subgraph 1
8.30/2.84	Checking unfeasibility...
8.30/2.84	Time used: 0.003457
8.30/2.84	
8.30/2.84	Checking conditional termination of SCC {l2}...
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000793s
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.002223s
8.30/2.84	[1014 : 1016]
8.30/2.84	[1014 : 1017]
8.30/2.84	Successful child: 1016
8.30/2.84	[ Invariant Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 1 + main_x + main_y + main_z + main_n <= 0, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	[ Termination Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 1 + main_x + main_y + main_z + main_n <= 0, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Ranking function: -main_z - main_n
8.30/2.84	New Graphs: 
8.30/2.84	
8.30/2.84	LOG: CALL check - Post:1 + main_x + main_y + main_z + main_n <= 0 - Process 1
8.30/2.84	* Exit transition: <l0, l2, main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
8.30/2.84	* Postcondition  : 1 + main_x + main_y + main_z + main_n <= 0
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000719s
8.30/2.84	> Postcondition is not implied!
8.30/2.84	
8.30/2.84	LOG: RETURN check - Elapsed time: 0.000851s
8.30/2.84	INVARIANTS: 
8.30/2.84	2: 
8.30/2.84	Quasi-INVARIANTS to narrow Graph: 
8.30/2.84	2: 1 + main_x + main_y + main_z + main_n <= 0 , 
8.30/2.84	Narrowing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	
8.30/2.84	LOG: Narrow transition size 1
8.30/2.84	invGraph after Narrowing: 
8.30/2.84	Transitions:
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Variables:
8.30/2.84	main_x, main_y, main_z, main_n
8.30/2.84	Checking conditional termination of SCC {l2}...
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000838s
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.003021s
8.30/2.84	[1014 : 1021]
8.30/2.84	[1014 : 1022]
8.30/2.84	Successful child: 1021
8.30/2.84	[ Invariant Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	It's unfeasible. Removing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	[ Termination Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	> It's unfeasible. Removing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	New Graphs: 
8.30/2.84	
8.30/2.84	LOG: CALL check - Post:1 + main_n <= main_x - Process 2
8.30/2.84	* Exit transition: <l0, l2, 0 <= main_x + main_y + main_z + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
8.30/2.84	* Postcondition  : 1 + main_n <= main_x
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000613s
8.30/2.84	> Postcondition is not implied!
8.30/2.84	
8.30/2.84	LOG: RETURN check - Elapsed time: 0.000755s
8.30/2.84	INVARIANTS: 
8.30/2.84	2: 
8.30/2.84	Quasi-INVARIANTS to narrow Graph: 
8.30/2.84	2: 1 + main_n <= main_x , 
8.30/2.84	Narrowing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	
8.30/2.84	LOG: Narrow transition size 1
8.30/2.84	invGraph after Narrowing: 
8.30/2.84	Transitions:
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Variables:
8.30/2.84	main_x, main_y, main_z, main_n
8.30/2.84	Checking conditional termination of SCC {l2}...
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000844s
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.002886s
8.30/2.84	[1014 : 1026]
8.30/2.84	[1014 : 1027]
8.30/2.84	Successful child: 1026
8.30/2.84	[ Invariant Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	It's unfeasible. Removing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	[ Termination Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	It's unfeasible. Removing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	New Graphs: 
8.30/2.84	
8.30/2.84	LOG: CALL check - Post:1 + main_y + main_n <= 0 - Process 3
8.30/2.84	* Exit transition: <l0, l2, main_x <= main_n /\ 0 <= main_x + main_y + main_z + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
8.30/2.84	* Postcondition  : 1 + main_y + main_n <= 0
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000683s
8.30/2.84	> Postcondition is not implied!
8.30/2.84	
8.30/2.84	LOG: RETURN check - Elapsed time: 0.000824s
8.30/2.84	INVARIANTS: 
8.30/2.84	2: 
8.30/2.84	Quasi-INVARIANTS to narrow Graph: 
8.30/2.84	2: 1 + main_y + main_n <= 0 , 
8.30/2.84	Narrowing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	
8.30/2.84	LOG: Narrow transition size 1
8.30/2.84	invGraph after Narrowing: 
8.30/2.84	Transitions:
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Variables:
8.30/2.84	main_x, main_y, main_z, main_n
8.30/2.84	Checking conditional termination of SCC {l2}...
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000899s
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.003183s
8.30/2.84	[1014 : 1031]
8.30/2.84	[1014 : 1032]
8.30/2.84	Successful child: 1031
8.30/2.84	[ Invariant Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	It's unfeasible. Removing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	[ Termination Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	> It's unfeasible. Removing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	New Graphs: 
8.30/2.84	
8.30/2.84	LOG: CALL check - Post:1 + main_x + main_y <= 0 - Process 4
8.30/2.84	* Exit transition: <l0, l2, main_x <= main_n /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
8.30/2.84	* Postcondition  : 1 + main_x + main_y <= 0
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000758s
8.30/2.84	> Postcondition is not implied!
8.30/2.84	
8.30/2.84	LOG: RETURN check - Elapsed time: 0.000911s
8.30/2.84	INVARIANTS: 
8.30/2.84	2: 
8.30/2.84	Quasi-INVARIANTS to narrow Graph: 
8.30/2.84	2: 1 + main_x + main_y <= 0 , 
8.30/2.84	Narrowing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	
8.30/2.84	LOG: Narrow transition size 1
8.30/2.84	invGraph after Narrowing: 
8.30/2.84	Transitions:
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Variables:
8.30/2.84	main_x, main_y, main_z, main_n
8.30/2.84	Checking conditional termination of SCC {l2}...
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000912s
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.003224s
8.30/2.84	[1014 : 1036]
8.30/2.84	[1014 : 1037]
8.30/2.84	Successful child: 1036
8.30/2.84	[ Invariant Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n /\ 1 + 2*main_x + main_y + main_z <= 0, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	[ Termination Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n /\ 1 + 2*main_x + main_y + main_z <= 0, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Ranking function: -main_x - main_z
8.30/2.84	New Graphs: 
8.30/2.84	
8.30/2.84	LOG: CALL check - Post:1 + 2*main_x + main_y + main_z <= 0 - Process 5
8.30/2.84	* Exit transition: <l0, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
8.30/2.84	* Postcondition  : 1 + 2*main_x + main_y + main_z <= 0
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000676s
8.30/2.84	> Postcondition is not implied!
8.30/2.84	
8.30/2.84	LOG: RETURN check - Elapsed time: 0.000846s
8.30/2.84	INVARIANTS: 
8.30/2.84	2: 
8.30/2.84	Quasi-INVARIANTS to narrow Graph: 
8.30/2.84	2: 1 + 2*main_x + main_y + main_z <= 0 , 
8.30/2.84	Narrowing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	
8.30/2.84	LOG: Narrow transition size 1
8.30/2.84	invGraph after Narrowing: 
8.30/2.84	Transitions:
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Variables:
8.30/2.84	main_x, main_y, main_z, main_n
8.30/2.84	Checking conditional termination of SCC {l2}...
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000989s
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.003548s
8.30/2.84	[1014 : 1041]
8.30/2.84	[1014 : 1042]
8.30/2.84	Successful child: 1041
8.30/2.84	[ Invariant Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_z + 2*main_n <= main_x, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	[ Termination Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_z + 2*main_n <= main_x, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Ranking function: -1 - main_z - main_n
8.30/2.84	New Graphs: 
8.30/2.84	
8.30/2.84	LOG: CALL check - Post:1 + main_z + 2*main_n <= main_x - Process 6
8.30/2.84	* Exit transition: <l0, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
8.30/2.84	* Postcondition  : 1 + main_z + 2*main_n <= main_x
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000711s
8.30/2.84	> Postcondition is not implied!
8.30/2.84	
8.30/2.84	LOG: RETURN check - Elapsed time: 0.000893s
8.30/2.84	INVARIANTS: 
8.30/2.84	2: 0 <= 2*main_x + main_y + main_z , 
8.30/2.84	Quasi-INVARIANTS to narrow Graph: 
8.30/2.84	2: 1 + main_z + 2*main_n <= main_x , 
8.30/2.84	Narrowing transition: 
8.30/2.84	<l2, l2, main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	
8.30/2.84	LOG: Narrow transition size 1
8.30/2.84	invGraph after Narrowing: 
8.30/2.84	Transitions:
8.30/2.84	<l2, l2, main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Variables:
8.30/2.84	main_x, main_y, main_z, main_n
8.30/2.84	Checking conditional termination of SCC {l2}...
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.001070s
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.003936s
8.30/2.84	[1014 : 1046]
8.30/2.84	[1014 : 1047]
8.30/2.84	Successful child: 1046
8.30/2.84	[ Invariant Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_n <= 2*main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	[ Termination Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_n <= 2*main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Ranking function: -main_x + main_n
8.30/2.84	New Graphs: 
8.30/2.84	
8.30/2.84	LOG: CALL check - Post:1 + main_n <= 2*main_x + main_y - Process 7
8.30/2.84	* Exit transition: <l0, l2, main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
8.30/2.84	* Postcondition  : 1 + main_n <= 2*main_x + main_y
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000778s
8.30/2.84	> Postcondition is not implied!
8.30/2.84	
8.30/2.84	LOG: RETURN check - Elapsed time: 0.000991s
8.30/2.84	INVARIANTS: 
8.30/2.84	2: 
8.30/2.84	Quasi-INVARIANTS to narrow Graph: 
8.30/2.84	2: 1 + main_n <= 2*main_x + main_y , 
8.30/2.84	Narrowing transition: 
8.30/2.84	<l2, l2, main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	
8.30/2.84	LOG: Narrow transition size 1
8.30/2.84	invGraph after Narrowing: 
8.30/2.84	Transitions:
8.30/2.84	<l2, l2, 2*main_x + main_y <= main_n /\ main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Variables:
8.30/2.84	main_x, main_y, main_z, main_n
8.30/2.84	Checking conditional termination of SCC {l2}...
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.001175s
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.004195s
8.30/2.84	[1014 : 1051]
8.30/2.84	[1014 : 1052]
8.30/2.84	Successful child: 1051
8.30/2.84	[ Invariant Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, 2*main_x + main_y <= main_n /\ main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_y <= main_z, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	[ Termination Graph ]
8.30/2.84	Strengthening and disabling transitions...
8.30/2.84	
8.30/2.84	LOG: CALL solverLinear in Graph for feasibility
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear in Graph for feasibility
8.30/2.84	Strengthening transition (result): 
8.30/2.84	<l2, l2, 2*main_x + main_y <= main_n /\ main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ 1 + main_y <= main_z, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	Ranking function: -2*main_x - main_y + main_n
8.30/2.84	New Graphs: 
8.30/2.84	
8.30/2.84	LOG: CALL check - Post:1 + main_y <= main_z - Process 8
8.30/2.84	* Exit transition: <l0, l2, 2*main_x + main_y <= main_n /\ main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n /\ main_x = undef5 /\ main_y = undef6 /\ main_z = undef7 /\ main_n = undef8, {all remain the same}>
8.30/2.84	* Postcondition  : 1 + main_y <= main_z
8.30/2.84	
8.30/2.84	LOG: CALL solveLinear
8.30/2.84	
8.30/2.84	LOG: RETURN solveLinear - Elapsed time: 0.000832s
8.30/2.84	> Postcondition is not implied!
8.30/2.84	
8.30/2.84	LOG: RETURN check - Elapsed time: 0.001027s
8.30/2.84	INVARIANTS: 
8.30/2.84	2: 0 <= main_x + main_y , 
8.30/2.84	Quasi-INVARIANTS to narrow Graph: 
8.30/2.84	2: 1 + main_y <= main_z , 
8.30/2.84	It's unfeasible. Removing transition: 
8.30/2.84	<l2, l2, 2*main_x + main_y <= main_n /\ main_x <= main_z + 2*main_n /\ main_x <= main_n /\ 0 <= main_x + main_y /\ 0 <= main_x + main_y + main_z + main_n /\ 0 <= 2*main_x + main_y + main_z /\ 0 <= main_y + main_n, {main_x -> 2*main_x + main_y, main_y -> main_z, main_z -> 1 + main_z, rest remain the same}>
8.30/2.84	invGraph after Narrowing: 
8.30/2.84	Transitions:
8.30/2.84	Variables:
8.30/2.84	main_x, main_y, main_z, main_n
8.30/2.84	Analyzing SCC {l2}...
8.30/2.84	No cycles found.
8.30/2.84	
8.30/2.84	Proving termination of subgraph 2
8.30/2.84	Analyzing SCC {l7}...
8.30/2.84	No cycles found.
8.30/2.84	
8.30/2.84	Program Terminates
8.30/2.84	EOF