2.71/1.43	YES
2.71/1.43	
2.71/1.43	Solver Timeout: 4
2.71/1.43	Global Timeout: 300
2.71/1.43	Maximum number of concurrent processes: 900
2.71/1.43	*******************************************************************************************
2.71/1.43	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
2.71/1.43	*******************************************************************************************
2.71/1.43	
2.71/1.43	
2.71/1.43	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
2.71/1.43	
2.71/1.43	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
2.71/1.43	+                                                                  +
2.71/1.43	Init Location: 0
2.71/1.43	Transitions:
2.71/1.43	<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)}>
2.71/1.43	<l1, l2, true>
2.71/1.43	<l2, l5, not((main_x >= 0))>
2.71/1.43	<l2, l3, (main_x >= 0)>
2.71/1.43	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> main_z, main_z -> (~(main_z) - 1)}>
2.71/1.43	<l4, l2, true>
2.71/1.43	<l5, l6, true, seq{main__func_return_ -> 0}>
2.71/1.43	
2.71/1.43	Fresh variables:
2.71/1.43	
2.71/1.43	Undef variables:
2.71/1.43	
2.71/1.43	Abstraction variables:
2.71/1.43	
2.71/1.43	Exit nodes:
2.71/1.43	
2.71/1.43	Accepting locations:
2.71/1.43	
2.71/1.43	Asserts:
2.71/1.43	
2.71/1.43	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
2.71/1.43	       
2.71/1.43	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
2.71/1.43	       
2.71/1.43	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
2.71/1.43	
2.71/1.43	Init Location: 0
2.71/1.43	Transitions:
2.71/1.43	<l0, l7, true, seq{main__func_return_ -> 0}>
2.71/1.43	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
2.71/1.43	<l8, l9, true, seq{main_x -> varCall_1}>
2.71/1.43	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
2.71/1.43	<l10, l11, true, seq{main_y -> varCall_2}>
2.71/1.43	<l11, l12, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
2.71/1.43	<l12, l1, true, seq{main_z -> varCall_3}>
2.71/1.43	<l1, l2, true>
2.71/1.43	<l2, l3, (main_x >= 0)>
2.71/1.43	<l2, l5, not((main_x >= 0))>
2.71/1.43	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> main_z, main_z -> (~(main_z) - 1)}>
2.71/1.43	<l4, l2, true>
2.71/1.43	<l5, l6, true, seq{main__func_return_ -> 0}>
2.71/1.43	
2.71/1.43	Fresh variables:
2.71/1.43	
2.71/1.43	Undef variables:
2.71/1.43	
2.71/1.43	Abstraction variables:
2.71/1.43	
2.71/1.43	Exit nodes:
2.71/1.43	6, 
2.71/1.43	Accepting locations:
2.71/1.43	
2.71/1.43	Asserts:
2.71/1.43	
2.71/1.43	+                                                                  +
2.71/1.43	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
2.71/1.43	
2.71/1.43	
2.71/1.43	Function Return and Parameters Information [2 functions]:
2.71/1.43	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
2.71/1.43	        __VERIFIER_nondet_int__func_return_      [function result] : int
2.71/1.43	    function name: main [1 return + 0 parameters]        demangled: main
2.71/1.43	        main__func_return_      [function result] : int
2.71/1.43	
2.71/1.43	
2.71/1.43	AST Ident Scanner Information [5 idents]:
2.71/1.43	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9>
2.71/1.43	main | function | [integer, ()] | <line: 22, col: 1>
2.71/1.43	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 27, col: 12> <line: 28, col: 9> <line: 28, col: 13>
2.71/1.43	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 28, col: 17> <line: 29, col: 9>
2.71/1.43	z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 29, col: 13> <line: 30, col: 9> <line: 30, col: 14>
2.71/1.43	
2.71/1.43	Main function: main
2.71/1.43	Preprocessed LLVMGraph
2.71/1.43	Init Location: 0
2.71/1.43	Transitions:
2.71/1.43	<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
2.71/1.43	<l2, l2, (main_x >= 0), par{main_x -> (main_x + main_y), main_y -> main_z, main_z -> (~(main_z) - 1)}>
2.71/1.43	<l2, l6, not((main_x >= 0))>
2.71/1.43	
2.71/1.43	Fresh variables:
2.71/1.43	undef4, undef5, undef6, 
2.71/1.43	
2.71/1.43	Undef variables:
2.71/1.43	undef4, undef5, undef6, 
2.71/1.43	
2.71/1.43	Abstraction variables:
2.71/1.43	
2.71/1.43	Exit nodes:
2.71/1.43	6, 
2.71/1.43	Accepting locations:
2.71/1.43	
2.71/1.43	Asserts:
2.71/1.43	
2.71/1.43	*************************************************************
2.71/1.43	*******************************************************************************************
2.71/1.43	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
2.71/1.43	*******************************************************************************************
2.71/1.43	
2.71/1.43	Init Location: 0
2.71/1.43	Graph 0:
2.71/1.43	Transitions:
2.71/1.43	Variables:
2.71/1.43	
2.71/1.43	Graph 1:
2.71/1.43	Transitions:
2.71/1.43	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	Variables:
2.71/1.43	main_x, main_y, main_z
2.71/1.43	
2.71/1.43	Graph 2:
2.71/1.43	Transitions:
2.71/1.43	Variables:
2.71/1.43	
2.71/1.43	Precedence: 
2.71/1.43	Graph 0
2.71/1.43	
2.71/1.43	Graph 1
2.71/1.43	<l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
2.71/1.43	
2.71/1.43	Graph 2
2.71/1.43	<l2, l6, 1 + main_x <= 0, {all remain the same}>
2.71/1.43	
2.71/1.43	Map Locations to Subgraph:
2.71/1.43	( 0 , 0 )
2.71/1.43	( 2 , 1 )
2.71/1.43	( 6 , 2 )
2.71/1.43	
2.71/1.43	*******************************************************************************************
2.71/1.43	********************************    CHECKING ASSERTIONS    ********************************
2.71/1.43	*******************************************************************************************
2.71/1.43	
2.71/1.43	Proving termination of subgraph 0
2.71/1.43	Proving termination of subgraph 1
2.71/1.43	Checking unfeasibility...
2.71/1.43	Time used: 0.002499
2.71/1.43	
2.71/1.43	Checking conditional termination of SCC {l2}...
2.71/1.43	
2.71/1.43	LOG: CALL solveLinear
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear - Elapsed time: 0.000734s
2.71/1.43	
2.71/1.43	LOG: CALL solveLinear
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear - Elapsed time: 0.001771s
2.71/1.43	[42646 : 42648]
2.71/1.43	[42646 : 42649]
2.71/1.43	Successful child: 42648
2.71/1.43	[ Invariant Graph ]
2.71/1.43	Strengthening and disabling transitions...
2.71/1.43	
2.71/1.43	LOG: CALL solverLinear in Graph for feasibility
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear in Graph for feasibility
2.71/1.43	It's unfeasible. Removing transition: 
2.71/1.43	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	[ Termination Graph ]
2.71/1.43	Strengthening and disabling transitions...
2.71/1.43	> It's unfeasible. Removing transition: 
2.71/1.43	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	New Graphs: 
2.71/1.43	
2.71/1.43	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
2.71/1.43	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
2.71/1.43	* Postcondition  : 1 + main_x <= 0
2.71/1.43	
2.71/1.43	LOG: CALL solveLinear
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear - Elapsed time: 0.000568s
2.71/1.43	> Postcondition is not implied!
2.71/1.43	
2.71/1.43	LOG: RETURN check - Elapsed time: 0.000681s
2.71/1.43	INVARIANTS: 
2.71/1.43	2: 
2.71/1.43	Quasi-INVARIANTS to narrow Graph: 
2.71/1.43	2: 1 + main_x <= 0 , 
2.71/1.43	Narrowing transition: 
2.71/1.43	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	
2.71/1.43	LOG: Narrow transition size 1
2.71/1.43	invGraph after Narrowing: 
2.71/1.43	Transitions:
2.71/1.43	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	Variables:
2.71/1.43	main_x, main_y, main_z
2.71/1.43	Checking conditional termination of SCC {l2}...
2.71/1.43	
2.71/1.43	LOG: CALL solveLinear
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear - Elapsed time: 0.000702s
2.71/1.43	
2.71/1.43	LOG: CALL solveLinear
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear - Elapsed time: 0.001879s
2.71/1.43	[42646 : 42653]
2.71/1.43	[42646 : 42654]
2.71/1.43	Successful child: 42653
2.71/1.43	[ Invariant Graph ]
2.71/1.43	Strengthening and disabling transitions...
2.71/1.43	
2.71/1.43	LOG: CALL solverLinear in Graph for feasibility
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear in Graph for feasibility
2.71/1.43	Strengthening transition (result): 
2.71/1.43	<l2, l2, 0 <= main_x /\ 0 <= 613 + main_x + main_y /\ 0 <= 613 + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	[ Termination Graph ]
2.71/1.43	Strengthening and disabling transitions...
2.71/1.43	
2.71/1.43	LOG: CALL solverLinear in Graph for feasibility
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear in Graph for feasibility
2.71/1.43	Strengthening transition (result): 
2.71/1.43	<l2, l2, 0 <= main_x /\ 0 <= 613 + main_x + main_y /\ 0 <= 613 + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	Ranking function: 1226 + 2*main_x + 2*main_y + main_z
2.71/1.43	New Graphs: 
2.71/1.43	[42646 : 42658]
2.71/1.43	[42646 : 42659]
2.71/1.43	INVARIANTS: 
2.71/1.43	2: 
2.71/1.43	Quasi-INVARIANTS to narrow Graph: 
2.71/1.43	2: 0 <= 613 + main_x + main_y , 0 <= 613 + main_y + main_z , 
2.71/1.43	Narrowing transition: 
2.71/1.43	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	
2.71/1.43	LOG: Narrow transition size 2
2.71/1.43	invGraph after Narrowing: 
2.71/1.43	Transitions:
2.71/1.43	<l2, l2, 0 <= main_x /\ 0 <= 613 + main_x + main_y /\ 614 + main_y + main_z <= 0, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	<l2, l2, 0 <= main_x /\ 614 + main_x + main_y <= 0, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	Variables:
2.71/1.43	main_x, main_y, main_z
2.71/1.43	Checking conditional termination of SCC {l2}...
2.71/1.43	
2.71/1.43	LOG: CALL solveLinear
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear - Elapsed time: 0.001240s
2.71/1.43	
2.71/1.43	LOG: CALL solveLinear
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear - Elapsed time: 0.009810s
2.71/1.43	Piecewise ranking function: min(0,main_x)
2.71/1.43	New Graphs: 
2.71/1.43	Transitions:
2.71/1.43	<l2, l2, 0 <= main_x /\ 0 <= 613 + main_x + main_y /\ 614 + main_y + main_z <= 0, {main_x -> main_x + main_y, main_y -> main_z, main_z -> -1 - main_z, rest remain the same}>
2.71/1.43	Variables:
2.71/1.43	main_x, main_y, main_z
2.71/1.43	Checking conditional termination of SCC {l2}...
2.71/1.43	
2.71/1.43	LOG: CALL solveLinear
2.71/1.43	
2.71/1.43	LOG: RETURN solveLinear - Elapsed time: 0.000951s
2.71/1.43	Ranking function: (613 / 614) + (1 / 307)*main_x + (1 / 614)*main_y
2.71/1.43	New Graphs: 
2.71/1.43	Proving termination of subgraph 2
2.71/1.43	Analyzing SCC {l6}...
2.71/1.43	No cycles found.
2.71/1.43	
2.71/1.43	Program Terminates
2.71/1.43	EOF