0.00/0.09	YES
0.00/0.09	
0.00/0.09	Solver Timeout: 4
0.00/0.09	Global Timeout: 300
0.00/0.09	Maximum number of concurrent processes: 900
0.00/0.09	*******************************************************************************************
0.00/0.09	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	
0.00/0.09	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.09	
0.00/0.09	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.09	+                                                                  +
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> 100, main_z -> 1}>
0.00/0.09	<l1, l2, true>
0.00/0.09	<l2, l5, not((main_x >= 0))>
0.00/0.09	<l2, l3, (main_x >= 0)>
0.00/0.09	<l3, l4, true, seq{main_x -> (main_x - main_y), main_y -> (main_y - main_z), main_z -> ~(main_z)}>
0.00/0.09	<l4, l2, true>
0.00/0.09	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.09	       
0.00/0.09	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.09	       
0.00/0.09	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.09	
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l7, true, seq{main__func_return_ -> 0}>
0.00/0.09	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l8, l1, true, seq{main_x -> varCall_1, main_y -> 100, main_z -> 1}>
0.00/0.09	<l1, l2, true>
0.00/0.09	<l2, l3, (main_x >= 0)>
0.00/0.09	<l2, l5, not((main_x >= 0))>
0.00/0.09	<l3, l4, true, seq{main_x -> (main_x - main_y), main_y -> (main_y - main_z), main_z -> ~(main_z)}>
0.00/0.09	<l4, l2, true>
0.00/0.09	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	6, 
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	+                                                                  +
0.00/0.09	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.09	
0.00/0.09	
0.00/0.09	Function Return and Parameters Information [2 functions]:
0.00/0.09	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.09	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.09	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.09	        main__func_return_      [function result] : int
0.00/0.09	
0.00/0.09	
0.00/0.09	AST Ident Scanner Information [5 idents]:
0.00/0.09	__VERIFIER_nondet_int | function | [integer, ()] | <line: 14, col: 1> | <line: 19, col: 6>
0.00/0.09	main | function | [integer, ()] | <line: 16, col: 1>
0.00/0.09	x | local variable | integer | <line: 18, col: 5> | <line: 19, col: 2> <line: 22, col: 9> <line: 23, col: 3> <line: 23, col: 7>
0.00/0.09	y | local variable | integer | <line: 18, col: 5> | <line: 20, col: 2> <line: 23, col: 11> <line: 24, col: 3> <line: 24, col: 7>
0.00/0.09	z | local variable | integer | <line: 18, col: 5> | <line: 21, col: 2> <line: 24, col: 11> <line: 25, col: 3> <line: 25, col: 8>
0.00/0.09	
0.00/0.09	Main function: main
0.00/0.09	Preprocessed LLVMGraph
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l2, (main_x = undef2) /\ (main_y = 100) /\ (main_z = 1)>
0.00/0.09	<l2, l2, (main_x >= 0), par{main_x -> (main_x - main_y), main_y -> (main_y - main_z), main_z -> ~(main_z)}>
0.00/0.09	<l2, l6, not((main_x >= 0))>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	undef2, 
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	undef2, 
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	6, 
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	*************************************************************
0.00/0.09	*******************************************************************************************
0.00/0.09	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Init Location: 0
0.00/0.09	Graph 0:
0.00/0.09	Transitions:
0.00/0.09	Variables:
0.00/0.09	
0.00/0.09	Graph 1:
0.00/0.09	Transitions:
0.00/0.09	<l2, l2, 0 <= main_x, {main_x -> main_x - main_y, main_y -> main_y - main_z, main_z -> -main_z, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	main_x, main_y, main_z
0.00/0.09	
0.00/0.09	Graph 2:
0.00/0.09	Transitions:
0.00/0.09	Variables:
0.00/0.09	
0.00/0.09	Precedence: 
0.00/0.09	Graph 0
0.00/0.09	
0.00/0.09	Graph 1
0.00/0.09	<l0, l2, main_x = undef2 /\ main_z = 1 /\ main_y = 100, {all remain the same}>
0.00/0.09	
0.00/0.09	Graph 2
0.00/0.09	<l2, l6, 1 + main_x <= 0, {all remain the same}>
0.00/0.09	
0.00/0.09	Map Locations to Subgraph:
0.00/0.09	( 0 , 0 )
0.00/0.09	( 2 , 1 )
0.00/0.09	( 6 , 2 )
0.00/0.09	
0.00/0.09	*******************************************************************************************
0.00/0.09	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Proving termination of subgraph 0
0.00/0.09	Proving termination of subgraph 1
0.00/0.09	Checking unfeasibility...
0.00/0.09	Time used: 0.002279
0.00/0.09	
0.00/0.09	Checking conditional termination of SCC {l2}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000747s
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.001730s
0.00/0.09	[43266 : 43268]
0.00/0.09	[43266 : 43269]
0.00/0.09	Successful child: 43268
0.00/0.09	[ Invariant Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ 1 + main_z <= main_y, {main_x -> main_x - main_y, main_y -> main_y - main_z, main_z -> -main_z, rest remain the same}>
0.00/0.09	[ Termination Graph ]
0.00/0.09	Strengthening and disabling transitions...
0.00/0.09	
0.00/0.09	LOG: CALL solverLinear in Graph for feasibility
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.09	Strengthening transition (result): 
0.00/0.09	<l2, l2, 0 <= main_x /\ 1 <= main_y /\ 1 + main_z <= main_y, {main_x -> main_x - main_y, main_y -> main_y - main_z, main_z -> -main_z, rest remain the same}>
0.00/0.09	Ranking function: main_x
0.00/0.09	New Graphs: 
0.00/0.09	INVARIANTS: 
0.00/0.09	2: 1 <= main_y , 1 + main_z <= main_y , 
0.00/0.09	Quasi-INVARIANTS to narrow Graph: 
0.00/0.09	2: 
0.00/0.09	Proving termination of subgraph 2
0.00/0.09	Analyzing SCC {l6}...
0.00/0.09	No cycles found.
0.00/0.09	
0.00/0.09	Program Terminates
0.00/0.09	EOF