2.26/0.90	YES
2.26/0.90	
2.26/0.90	Solver Timeout: 4
2.26/0.90	Global Timeout: 300
2.26/0.90	Maximum number of concurrent processes: 900
2.26/0.90	*******************************************************************************************
2.26/0.90	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
2.26/0.90	*******************************************************************************************
2.26/0.90	
2.26/0.90	
2.26/0.90	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
2.26/0.90	
2.26/0.90	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
2.26/0.90	+                                                                  +
2.26/0.90	Init Location: 0
2.26/0.90	Transitions:
2.26/0.90	<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_tx -> ¿functionCall(__VERIFIER_nondet_int)}>
2.26/0.90	<l1, l2, true>
2.26/0.90	<l2, l10, not((main_x >= main_y))>
2.26/0.90	<l2, l3, (main_x >= main_y)>
2.26/0.90	<l3, l10, not((main_x <= (main_tx + main_z)))>
2.26/0.90	<l3, l4, (main_x <= (main_tx + main_z))>
2.26/0.90	<l4, l5, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
2.26/0.90	<l4, l7, (¿functionCall(__VERIFIER_nondet_int) = 0)>
2.26/0.90	<l5, l6, true, seq{main_z -> (main_z - 1), main_tx -> main_x, main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
2.26/0.90	<l6, l9, true>
2.26/0.90	<l7, l8, true, seq{main_y -> (main_y + 1)}>
2.26/0.90	<l8, l9, true>
2.26/0.90	<l9, l2, true>
2.26/0.90	<l10, l11, true, seq{main__func_return_ -> 0}>
2.26/0.90	
2.26/0.90	Fresh variables:
2.26/0.90	
2.26/0.90	Undef variables:
2.26/0.90	
2.26/0.90	Abstraction variables:
2.26/0.90	
2.26/0.90	Exit nodes:
2.26/0.90	
2.26/0.90	Accepting locations:
2.26/0.90	
2.26/0.90	Asserts:
2.26/0.90	
2.26/0.90	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
2.26/0.90	       
2.26/0.90	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
2.26/0.90	       
2.26/0.90	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
2.26/0.90	
2.26/0.90	Init Location: 0
2.26/0.90	Transitions:
2.26/0.90	<l0, l12, true, seq{main__func_return_ -> 0}>
2.26/0.90	<l12, l13, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
2.26/0.90	<l13, l14, true, seq{main_x -> varCall_1}>
2.26/0.90	<l14, l15, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
2.26/0.90	<l15, l16, true, seq{main_y -> varCall_2}>
2.26/0.90	<l16, l17, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
2.26/0.90	<l17, l18, true, seq{main_z -> varCall_3}>
2.26/0.90	<l18, l19, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
2.26/0.90	<l19, l1, true, seq{main_tx -> varCall_4}>
2.26/0.90	<l1, l2, true>
2.26/0.90	<l2, l3, (main_x >= main_y)>
2.26/0.90	<l2, l10, not((main_x >= main_y))>
2.26/0.90	<l3, l4, (main_x <= (main_tx + main_z))>
2.26/0.90	<l3, l10, not((main_x <= (main_tx + main_z)))>
2.26/0.90	<l4, l20, true, seq{varCall_5 -> ¿functionCall(__VERIFIER_nondet_int)}>
2.26/0.90	<l20, l7, (varCall_5 = 0)>
2.26/0.90	<l20, l5, (varCall_5 = 1)>
2.26/0.90	<l5, l21, true, seq{main_z -> (main_z - 1), main_tx -> main_x}>
2.26/0.90	<l21, l22, true, seq{varCall_6 -> ¿functionCall(__VERIFIER_nondet_int)}>
2.26/0.90	<l22, l6, true, seq{main_x -> varCall_6}>
2.26/0.90	<l6, l9, true>
2.26/0.90	<l7, l8, true, seq{main_y -> (main_y + 1)}>
2.26/0.90	<l8, l9, true>
2.26/0.90	<l9, l2, true>
2.26/0.90	<l10, l11, true, seq{main__func_return_ -> 0}>
2.26/0.90	
2.26/0.90	Fresh variables:
2.26/0.90	
2.26/0.90	Undef variables:
2.26/0.90	
2.26/0.90	Abstraction variables:
2.26/0.90	
2.26/0.90	Exit nodes:
2.26/0.90	11, 
2.26/0.90	Accepting locations:
2.26/0.90	
2.26/0.90	Asserts:
2.26/0.90	
2.26/0.90	+                                                                  +
2.26/0.90	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
2.26/0.90	
2.26/0.90	
2.26/0.90	Function Return and Parameters Information [2 functions]:
2.26/0.90	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
2.26/0.90	        __VERIFIER_nondet_int__func_return_      [function result] : int
2.26/0.90	    function name: main [1 return + 0 parameters]        demangled: main
2.26/0.90	        main__func_return_      [function result] : int
2.26/0.90	
2.26/0.90	
2.26/0.90	AST Ident Scanner Information [6 idents]:
2.26/0.90	__VERIFIER_nondet_int | function | [integer, ()] | <line: 13, col: 1> | <line: 17, col: 6> <line: 18, col: 6> <line: 19, col: 6> <line: 20, col: 7> <line: 22, col: 7> <line: 25, col: 8>
2.26/0.90	main | function | [integer, ()] | <line: 15, col: 1>
2.26/0.90	x | local variable | integer | <line: 16, col: 5> | <line: 17, col: 2> <line: 21, col: 9> <line: 21, col: 19> <line: 24, col: 9> <line: 25, col: 4>
2.26/0.90	y | local variable | integer | <line: 16, col: 5> | <line: 18, col: 2> <line: 21, col: 14> <line: 27, col: 4> <line: 27, col: 8>
2.26/0.90	z | local variable | integer | <line: 16, col: 5> | <line: 19, col: 2> <line: 21, col: 29> <line: 23, col: 4> <line: 23, col: 8>
2.26/0.90	tx | local variable | integer | <line: 16, col: 5> | <line: 20, col: 2> <line: 21, col: 24> <line: 24, col: 4>
2.26/0.90	
2.26/0.90	Main function: main
2.26/0.90	Preprocessed LLVMGraph
2.26/0.90	Init Location: 0
2.26/0.90	Transitions:
2.26/0.90	<l0, l2, (main_x = undef7) /\ (main_y = undef8) /\ (main_z = undef9) /\ (main_tx = undef10)>
2.26/0.90	<l2, l2, (main_x >= main_y) /\ (main_x <= (main_tx + main_z)) /\ (undef11 = 0), par{main_y -> (main_y + 1)}>
2.26/0.90	<l2, l2, (main_x >= main_y) /\ (main_x <= (main_tx + main_z)) /\ (undef11 = 1), par{main_x -> undef12, main_z -> (main_z - 1), main_tx -> main_x}>
2.26/0.90	<l2, l11, (main_x >= main_y) /\ not((main_x <= (main_tx + main_z)))>
2.26/0.90	<l2, l11, not((main_x >= main_y))>
2.26/0.90	
2.26/0.90	Fresh variables:
2.26/0.90	undef7, undef8, undef9, undef10, undef11, undef12, 
2.26/0.90	
2.26/0.90	Undef variables:
2.26/0.90	undef7, undef8, undef9, undef10, undef11, undef12, 
2.26/0.90	
2.26/0.90	Abstraction variables:
2.26/0.90	
2.26/0.90	Exit nodes:
2.26/0.90	11, 
2.26/0.90	Accepting locations:
2.26/0.90	
2.26/0.90	Asserts:
2.26/0.90	
2.26/0.90	*************************************************************
2.26/0.90	*******************************************************************************************
2.26/0.90	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
2.26/0.90	*******************************************************************************************
2.26/0.90	
2.26/0.90	Init Location: 0
2.26/0.90	Graph 0:
2.26/0.90	Transitions:
2.26/0.90	Variables:
2.26/0.90	
2.26/0.90	Graph 1:
2.26/0.90	Transitions:
2.26/0.90	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.90	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.90	Variables:
2.26/0.90	main_x, main_y, main_z, main_tx
2.26/0.90	
2.26/0.90	Graph 2:
2.26/0.90	Transitions:
2.26/0.90	Variables:
2.26/0.90	
2.26/0.90	Precedence: 
2.26/0.90	Graph 0
2.26/0.90	
2.26/0.90	Graph 1
2.26/0.90	<l0, l2, main_x = undef7 /\ main_y = undef8 /\ main_z = undef9 /\ main_tx = undef10, {all remain the same}>
2.26/0.90	
2.26/0.90	Graph 2
2.26/0.90	<l2, l11, main_y <= main_x /\ 1 + main_z + main_tx <= main_x, {all remain the same}>
2.26/0.90	<l2, l11, 1 + main_x <= main_y, {all remain the same}>
2.26/0.90	
2.26/0.90	Map Locations to Subgraph:
2.26/0.90	( 0 , 0 )
2.26/0.90	( 2 , 1 )
2.26/0.90	( 11 , 2 )
2.26/0.90	
2.26/0.90	*******************************************************************************************
2.26/0.90	********************************    CHECKING ASSERTIONS    ********************************
2.26/0.90	*******************************************************************************************
2.26/0.90	
2.26/0.90	Proving termination of subgraph 0
2.26/0.90	Proving termination of subgraph 1
2.26/0.90	Checking unfeasibility...
2.26/0.90	Time used: 0.006139
2.26/0.90	
2.26/0.90	Checking conditional termination of SCC {l2}...
2.26/0.90	
2.26/0.90	LOG: CALL solveLinear
2.26/0.90	
2.26/0.90	LOG: RETURN solveLinear - Elapsed time: 0.001880s
2.26/0.90	
2.26/0.90	LOG: CALL solveLinear
2.26/0.90	
2.26/0.90	LOG: RETURN solveLinear - Elapsed time: 0.009377s
2.26/0.90	[6177 : 6179]
2.26/0.90	[6177 : 6180]
2.26/0.90	Successful child: 6179
2.26/0.90	[ Invariant Graph ]
2.26/0.90	Strengthening and disabling transitions...
2.26/0.90	
2.26/0.90	LOG: CALL solverLinear in Graph for feasibility
2.26/0.90	
2.26/0.90	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.90	It's unfeasible. Removing transition: 
2.26/0.90	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.90	
2.26/0.90	LOG: CALL solverLinear in Graph for feasibility
2.26/0.90	
2.26/0.90	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	[ Termination Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	> It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	New Graphs: 
2.26/0.91	
2.26/0.91	LOG: CALL check - Post:1 + main_x <= main_y - Process 1
2.26/0.91	* Exit transition: <l0, l2, main_x = undef7 /\ main_y = undef8 /\ main_z = undef9 /\ main_tx = undef10, {all remain the same}>
2.26/0.91	* Postcondition  : 1 + main_x <= main_y
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.000748s
2.26/0.91	> Postcondition is not implied!
2.26/0.91	
2.26/0.91	LOG: RETURN check - Elapsed time: 0.000888s
2.26/0.91	INVARIANTS: 
2.26/0.91	2: 
2.26/0.91	Quasi-INVARIANTS to narrow Graph: 
2.26/0.91	2: 1 + main_x <= main_y , 
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 1
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 1
2.26/0.91	invGraph after Narrowing: 
2.26/0.91	Transitions:
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Variables:
2.26/0.91	main_x, main_y, main_z, main_tx
2.26/0.91	Checking conditional termination of SCC {l2}...
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.001771s
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.009551s
2.26/0.91	[6177 : 6184]
2.26/0.91	[6177 : 6185]
2.26/0.91	Successful child: 6184
2.26/0.91	[ Invariant Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	[ Termination Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	New Graphs: 
2.26/0.91	
2.26/0.91	LOG: CALL check - Post:1 + main_z + main_tx <= main_y - Process 2
2.26/0.91	* Exit transition: <l0, l2, main_y <= main_x /\ main_x = undef7 /\ main_y = undef8 /\ main_z = undef9 /\ main_tx = undef10, {all remain the same}>
2.26/0.91	* Postcondition  : 1 + main_z + main_tx <= main_y
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.000927s
2.26/0.91	> Postcondition is not implied!
2.26/0.91	
2.26/0.91	LOG: RETURN check - Elapsed time: 0.001060s
2.26/0.91	INVARIANTS: 
2.26/0.91	2: 
2.26/0.91	Quasi-INVARIANTS to narrow Graph: 
2.26/0.91	2: 1 + main_z + main_tx <= main_y , 
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 1
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 1
2.26/0.91	invGraph after Narrowing: 
2.26/0.91	Transitions:
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Variables:
2.26/0.91	main_x, main_y, main_z, main_tx
2.26/0.91	Checking conditional termination of SCC {l2}...
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.001558s
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.009975s
2.26/0.91	[6177 : 6189]
2.26/0.91	[6177 : 6190]
2.26/0.91	Successful child: 6189
2.26/0.91	[ Invariant Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	[ Termination Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Ranking function: -main_y + main_z + main_tx
2.26/0.91	New Graphs: 
2.26/0.91	Transitions:
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Variables:
2.26/0.91	main_x, main_y, main_z, main_tx
2.26/0.91	Checking conditional termination of SCC {l2}...
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.000937s
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.003755s
2.26/0.91	[6177 : 6194]
2.26/0.91	[6177 : 6195]
2.26/0.91	Successful child: 6194
2.26/0.91	[ Invariant Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	[ Termination Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	> It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	New Graphs: 
2.26/0.91	
2.26/0.91	LOG: CALL check - Post:main_z <= 1 - Process 3
2.26/0.91	* Exit transition: <l0, l2, main_y <= main_x /\ main_y <= main_z + main_tx /\ main_x = undef7 /\ main_y = undef8 /\ main_z = undef9 /\ main_tx = undef10, {all remain the same}>
2.26/0.91	* Postcondition  : main_z <= 1
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.000975s
2.26/0.91	> Postcondition is not implied!
2.26/0.91	
2.26/0.91	LOG: RETURN check - Elapsed time: 0.001104s
2.26/0.91	INVARIANTS: 
2.26/0.91	2: 
2.26/0.91	Quasi-INVARIANTS to narrow Graph: 
2.26/0.91	2: main_z <= 1 , 
2.26/0.91	
2.26/0.91	LOG: CALL check - Post:1 + main_z + main_tx <= main_x - Process 4
2.26/0.91	* Exit transition: <l0, l2, main_y <= main_x /\ main_y <= main_z + main_tx /\ main_x = undef7 /\ main_y = undef8 /\ main_z = undef9 /\ main_tx = undef10, {all remain the same}>
2.26/0.91	* Postcondition  : 1 + main_z + main_tx <= main_x
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.000806s
2.26/0.91	> Postcondition is not implied!
2.26/0.91	
2.26/0.91	LOG: RETURN check - Elapsed time: 0.000941s
2.26/0.91	INVARIANTS: 
2.26/0.91	2: 
2.26/0.91	Quasi-INVARIANTS to narrow Graph: 
2.26/0.91	2: 1 + main_z + main_tx <= main_x , 
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 2
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 2
2.26/0.91	invGraph after Narrowing: 
2.26/0.91	Transitions:
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Variables:
2.26/0.91	main_x, main_y, main_z, main_tx
2.26/0.91	Checking conditional termination of SCC {l2}...
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.001640s
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.010219s
2.26/0.91	[6177 : 6199]
2.26/0.91	[6177 : 6200]
2.26/0.91	Successful child: 6199
2.26/0.91	[ Invariant Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	[ Termination Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	> It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	It's unfeasible. Removing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	New Graphs: 
2.26/0.91	
2.26/0.91	LOG: CALL check - Post:1 + main_z + main_tx <= main_x - Process 5
2.26/0.91	* Exit transition: <l0, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_x = undef7 /\ main_y = undef8 /\ main_z = undef9 /\ main_tx = undef10, {all remain the same}>
2.26/0.91	* Postcondition  : 1 + main_z + main_tx <= main_x
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.000835s
2.26/0.91	> Postcondition is not implied!
2.26/0.91	
2.26/0.91	LOG: RETURN check - Elapsed time: 0.000993s
2.26/0.91	INVARIANTS: 
2.26/0.91	2: 
2.26/0.91	Quasi-INVARIANTS to narrow Graph: 
2.26/0.91	2: 1 + main_z + main_tx <= main_x , 
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 1
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 1
2.26/0.91	invGraph after Narrowing: 
2.26/0.91	Transitions:
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Variables:
2.26/0.91	main_x, main_y, main_z, main_tx
2.26/0.91	Checking conditional termination of SCC {l2}...
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.001638s
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.009791s
2.26/0.91	[6177 : 6204]
2.26/0.91	[6177 : 6205]
2.26/0.91	Successful child: 6204
2.26/0.91	[ Invariant Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	[ Termination Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Ranking function: -main_y + main_z + main_tx
2.26/0.91	New Graphs: 
2.26/0.91	Transitions:
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 1 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Variables:
2.26/0.91	main_x, main_y, main_z, main_tx
2.26/0.91	Checking conditional termination of SCC {l2}...
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.000939s
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.003716s
2.26/0.91	[6177 : 6209]
2.26/0.91	[6177 : 6210]
2.26/0.91	Successful child: 6209
2.26/0.91	[ Invariant Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 0 /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 0 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	[ Termination Graph ]
2.26/0.91	Strengthening and disabling transitions...
2.26/0.91	
2.26/0.91	LOG: CALL solverLinear in Graph for feasibility
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear in Graph for feasibility
2.26/0.91	Strengthening transition (result): 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_z <= 0 /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Ranking function: -main_y + main_z + main_tx
2.26/0.91	New Graphs: 
2.26/0.91	
2.26/0.91	LOG: CALL check - Post:main_z <= 1 - Process 6
2.26/0.91	* Exit transition: <l0, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ main_x = undef7 /\ main_y = undef8 /\ main_z = undef9 /\ main_tx = undef10, {all remain the same}>
2.26/0.91	* Postcondition  : main_z <= 1
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.000810s
2.26/0.91	> Postcondition is not implied!
2.26/0.91	
2.26/0.91	LOG: RETURN check - Elapsed time: 0.000948s
2.26/0.91	INVARIANTS: 
2.26/0.91	2: 
2.26/0.91	Quasi-INVARIANTS to narrow Graph: 
2.26/0.91	2: main_z <= 1 , 
2.26/0.91	INVARIANTS: 
2.26/0.91	2: 
2.26/0.91	Quasi-INVARIANTS to narrow Graph: 
2.26/0.91	2: main_z <= 0 , 
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 2
2.26/0.91	Narrowing transition: 
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	
2.26/0.91	LOG: Narrow transition size 2
2.26/0.91	invGraph after Narrowing: 
2.26/0.91	Transitions:
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ 1 <= main_z /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ 1 <= main_z /\ undef11 = 1, {main_x -> undef12, main_z -> -1 + main_z, main_tx -> main_x, rest remain the same}>
2.26/0.91	Variables:
2.26/0.91	main_x, main_y, main_z, main_tx
2.26/0.91	Checking conditional termination of SCC {l2}...
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.002491s
2.26/0.91	Ranking function: 1 + main_z
2.26/0.91	New Graphs: 
2.26/0.91	Transitions:
2.26/0.91	<l2, l2, main_x <= main_z + main_tx /\ main_y <= main_x /\ main_y <= main_z + main_tx /\ 1 <= main_z /\ undef11 = 0, {main_y -> 1 + main_y, rest remain the same}>
2.26/0.91	Variables:
2.26/0.91	main_x, main_y, main_z, main_tx
2.26/0.91	Checking conditional termination of SCC {l2}...
2.26/0.91	
2.26/0.91	LOG: CALL solveLinear
2.26/0.91	
2.26/0.91	LOG: RETURN solveLinear - Elapsed time: 0.001282s
2.26/0.91	Ranking function: main_x - main_y
2.26/0.91	New Graphs: 
2.26/0.91	Proving termination of subgraph 2
2.26/0.91	Analyzing SCC {l11}...
2.26/0.91	No cycles found.
2.26/0.91	
2.26/0.91	Program Terminates
2.26/0.91	EOF