0.00/0.02	YES
0.00/0.02	
0.00/0.02	Solver Timeout: 4
0.00/0.02	Global Timeout: 300
0.00/0.02	Maximum number of concurrent processes: 900
0.00/0.02	*******************************************************************************************
0.00/0.02	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.02	*******************************************************************************************
0.00/0.02	
0.00/0.02	
0.00/0.02	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.02	
0.00/0.02	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.02	+                                                                  +
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<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)}>
0.00/0.02	<l1, l2, true>
0.00/0.02	<l2, l6, not((main_x > main_y))>
0.00/0.02	<l2, l3, (main_x > main_y)>
0.00/0.02	<l3, l6, not((main_x > main_z))>
0.00/0.02	<l3, l4, (main_x > main_z)>
0.00/0.02	<l4, l5, true, seq{main_y -> (main_y + 1), main_z -> (main_z + 1)}>
0.00/0.02	<l5, l2, true>
0.00/0.02	<l6, l7, true, seq{main__func_return_ -> 0}>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.02	       
0.00/0.02	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.02	       
0.00/0.02	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.02	
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<l0, l8, true, seq{main__func_return_ -> 0}>
0.00/0.02	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.02	<l9, l10, true, seq{main_x -> varCall_1}>
0.00/0.02	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.02	<l11, l12, true, seq{main_y -> varCall_2}>
0.00/0.02	<l12, l13, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.02	<l13, l1, true, seq{main_z -> varCall_3}>
0.00/0.02	<l1, l2, true>
0.00/0.02	<l2, l3, (main_x > main_y)>
0.00/0.02	<l2, l6, not((main_x > main_y))>
0.00/0.02	<l3, l4, (main_x > main_z)>
0.00/0.02	<l3, l6, not((main_x > main_z))>
0.00/0.02	<l4, l5, true, seq{main_y -> (main_y + 1), main_z -> (main_z + 1)}>
0.00/0.02	<l5, l2, true>
0.00/0.02	<l6, l7, true, seq{main__func_return_ -> 0}>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	7, 
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	+                                                                  +
0.00/0.02	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.02	
0.00/0.02	
0.00/0.02	Function Return and Parameters Information [2 functions]:
0.00/0.02	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.02	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.02	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.02	        main__func_return_      [function result] : int
0.00/0.02	
0.00/0.02	
0.00/0.02	AST Ident Scanner Information [5 idents]:
0.00/0.02	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 9, col: 9> <line: 10, col: 9> <line: 11, col: 9>
0.00/0.02	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.02	x | local variable | integer | <line: 6, col: 5> | <line: 9, col: 5> <line: 13, col: 12> <line: 13, col: 21>
0.00/0.02	y | local variable | integer | <line: 7, col: 5> | <line: 10, col: 5> <line: 13, col: 16> <line: 14, col: 9> <line: 14, col: 13>
0.00/0.03	z | local variable | integer | <line: 8, col: 5> | <line: 11, col: 5> <line: 13, col: 25> <line: 15, col: 9> <line: 15, col: 13>
0.00/0.03	
0.00/0.03	Main function: main
0.00/0.03	Preprocessed LLVMGraph
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
0.00/0.03	<l2, l2, (main_x > main_y) /\ (main_x > main_z), par{main_y -> (main_y + 1), main_z -> (main_z + 1)}>
0.00/0.03	<l2, l7, (main_x > main_y) /\ not((main_x > main_z))>
0.00/0.03	<l2, l7, not((main_x > main_y))>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef4, undef5, undef6, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef4, undef5, undef6, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	7, 
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	*************************************************************
0.00/0.03	*******************************************************************************************
0.00/0.03	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Graph 0:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Graph 1:
0.00/0.03	Transitions:
0.00/0.03	<l2, l2, 1 + main_y <= main_x /\ 1 + main_z <= main_x, {main_y -> 1 + main_y, main_z -> 1 + main_z, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	main_x, main_y, main_z
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Precedence: 
0.00/0.03	Graph 0
0.00/0.03	
0.00/0.03	Graph 1
0.00/0.03	<l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l2, l7, main_x <= main_z /\ 1 + main_y <= main_x, {all remain the same}>
0.00/0.03	<l2, l7, main_x <= main_y, {all remain the same}>
0.00/0.03	
0.00/0.03	Map Locations to Subgraph:
0.00/0.03	( 0 , 0 )
0.00/0.03	( 2 , 1 )
0.00/0.03	( 7 , 2 )
0.00/0.03	
0.00/0.03	*******************************************************************************************
0.00/0.03	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Proving termination of subgraph 0
0.00/0.03	Proving termination of subgraph 1
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.002452
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l2}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.000778s
0.00/0.03	Ranking function: -1 + main_x - main_y
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Analyzing SCC {l7}...
0.00/0.03	No cycles found.
0.00/0.03	
0.00/0.03	Program Terminates
0.00/0.03	EOF