0.00/0.08	YES
0.00/0.08	
0.00/0.08	Solver Timeout: 4
0.00/0.08	Global Timeout: 300
0.00/0.08	Maximum number of concurrent processes: 900
0.00/0.08	*******************************************************************************************
0.00/0.08	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	
0.00/0.08	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.08	
0.00/0.08	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.08	+                                                                  +
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<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.08	<l1, l2, true>
0.00/0.08	<l2, l11, not((main_x > 0))>
0.00/0.08	<l2, l3, (main_x > 0)>
0.00/0.08	<l3, l11, not((main_y > 0))>
0.00/0.08	<l3, l4, (main_y > 0)>
0.00/0.08	<l4, l11, not((main_z > 0))>
0.00/0.08	<l4, l5, (main_z > 0)>
0.00/0.08	<l5, l6, (main_y > main_x)>
0.00/0.08	<l5, l8, not((main_y > main_x))>
0.00/0.08	<l6, l7, true, seq{main_y -> main_z, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_z -> (main_x - 1)}>
0.00/0.08	<l7, l10, true>
0.00/0.08	<l8, l9, true, seq{main_z -> (main_z - 1), main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> (main_x - 1)}>
0.00/0.08	<l9, l10, true>
0.00/0.08	<l10, l2, true>
0.00/0.08	<l11, l12, true, seq{main__func_return_ -> 0}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.08	       
0.00/0.08	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.08	       
0.00/0.08	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.08	
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l13, true, seq{main__func_return_ -> 0}>
0.00/0.08	<l13, l14, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.08	<l14, l15, true, seq{main_x -> varCall_1}>
0.00/0.08	<l15, l16, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.08	<l16, l17, true, seq{main_y -> varCall_2}>
0.00/0.08	<l17, l18, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.08	<l18, l1, true, seq{main_z -> varCall_3}>
0.00/0.08	<l1, l2, true>
0.00/0.08	<l2, l3, (main_x > 0)>
0.00/0.08	<l2, l11, not((main_x > 0))>
0.00/0.08	<l3, l4, (main_y > 0)>
0.00/0.08	<l3, l11, not((main_y > 0))>
0.00/0.08	<l4, l5, (main_z > 0)>
0.00/0.08	<l4, l11, not((main_z > 0))>
0.00/0.08	<l5, l6, (main_y > main_x)>
0.00/0.08	<l5, l8, not((main_y > main_x))>
0.00/0.08	<l6, l19, true, seq{main_y -> main_z}>
0.00/0.08	<l19, l20, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.08	<l20, l7, true, seq{main_x -> varCall_4, main_z -> (main_x - 1)}>
0.00/0.08	<l7, l10, true>
0.00/0.08	<l8, l21, true, seq{main_z -> (main_z - 1)}>
0.00/0.08	<l21, l22, true, seq{varCall_5 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.08	<l22, l9, true, seq{main_x -> varCall_5, main_y -> (main_x - 1)}>
0.00/0.08	<l9, l10, true>
0.00/0.08	<l10, l2, true>
0.00/0.08	<l11, l12, true, seq{main__func_return_ -> 0}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	12, 
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	+                                                                  +
0.00/0.08	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.08	
0.00/0.08	
0.00/0.08	Function Return and Parameters Information [2 functions]:
0.00/0.08	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.08	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.08	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.08	        main__func_return_      [function result] : int
0.00/0.08	
0.00/0.08	
0.00/0.08	AST Ident Scanner Information [5 idents]:
0.00/0.08	__VERIFIER_nondet_int | function | [integer, ()] | <line: 12, col: 1> | <line: 16, col: 6> <line: 17, col: 6> <line: 18, col: 6> <line: 23, col: 8> <line: 27, col: 8>
0.00/0.08	main | function | [integer, ()] | <line: 14, col: 1>
0.00/0.08	x | local variable | integer | <line: 15, col: 5> | <line: 16, col: 2> <line: 20, col: 9> <line: 21, col: 11> <line: 23, col: 4> <line: 24, col: 8> <line: 27, col: 4> <line: 28, col: 8>
0.00/0.08	y | local variable | integer | <line: 15, col: 5> | <line: 17, col: 2> <line: 20, col: 18> <line: 21, col: 7> <line: 22, col: 4> <line: 28, col: 4>
0.00/0.08	z | local variable | integer | <line: 15, col: 5> | <line: 18, col: 2> <line: 20, col: 27> <line: 22, col: 8> <line: 24, col: 4> <line: 26, col: 4> <line: 26, col: 8>
0.00/0.08	
0.00/0.08	Main function: main
0.00/0.08	Preprocessed LLVMGraph
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l2, (main_x = undef6) /\ (main_y = undef7) /\ (main_z = undef8)>
0.00/0.08	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (main_z > 0) /\ (main_y > main_x), par{main_x -> undef9, main_y -> main_z, main_z -> (undef9 - 1)}>
0.00/0.08	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (main_z > 0) /\ not((main_y > main_x)), par{main_x -> undef10, main_y -> (undef10 - 1), main_z -> (main_z - 1)}>
0.00/0.08	<l2, l12, (main_x > 0) /\ (main_y > 0) /\ not((main_z > 0))>
0.00/0.08	<l2, l12, (main_x > 0) /\ not((main_y > 0))>
0.00/0.08	<l2, l12, not((main_x > 0))>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	undef6, undef7, undef8, undef9, undef10, 
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	undef6, undef7, undef8, undef9, undef10, 
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	12, 
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	*************************************************************
0.00/0.08	*******************************************************************************************
0.00/0.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Init Location: 0
0.00/0.08	Graph 0:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Graph 1:
0.00/0.08	Transitions:
0.00/0.08	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y /\ 1 <= main_z, {main_x -> undef9, main_y -> main_z, main_z -> -1 + undef9, rest remain the same}>
0.00/0.08	<l2, l2, main_y <= main_x /\ 1 <= main_x /\ 1 <= main_y /\ 1 <= main_z, {main_x -> undef10, main_y -> -1 + undef10, main_z -> -1 + main_z, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	main_x, main_y, main_z
0.00/0.08	
0.00/0.08	Graph 2:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Precedence: 
0.00/0.08	Graph 0
0.00/0.08	
0.00/0.08	Graph 1
0.00/0.08	<l0, l2, main_x = undef6 /\ main_y = undef7 /\ main_z = undef8, {all remain the same}>
0.00/0.08	
0.00/0.08	Graph 2
0.00/0.08	<l2, l12, main_z <= 0 /\ 1 <= main_x /\ 1 <= main_y, {all remain the same}>
0.00/0.08	<l2, l12, main_y <= 0 /\ 1 <= main_x, {all remain the same}>
0.00/0.08	<l2, l12, main_x <= 0, {all remain the same}>
0.00/0.08	
0.00/0.08	Map Locations to Subgraph:
0.00/0.08	( 0 , 0 )
0.00/0.08	( 2 , 1 )
0.00/0.08	( 12 , 2 )
0.00/0.08	
0.00/0.08	*******************************************************************************************
0.00/0.08	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Proving termination of subgraph 0
0.00/0.08	Proving termination of subgraph 1
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.004955
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l2}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001476s
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.013632s
0.00/0.08	[24019 : 24021]
0.00/0.08	[24019 : 24022]
0.00/0.08	Successful child: 24022
0.00/0.08	Ranking function: main_z
0.00/0.08	Ranking function and negation of Quasi-Invariant applied
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y /\ 1 <= main_z, {main_x -> undef9, main_y -> main_z, main_z -> -1 + undef9, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	main_x, main_y, main_z
0.00/0.08	Checking conditional termination of SCC {l2}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001206s
0.00/0.08	Ranking function: -1 + (~(1) / 2)*main_x + (1 / 2)*main_y + (1 / 2)*main_z
0.00/0.08	New Graphs: 
0.00/0.08	Proving termination of subgraph 2
0.00/0.08	Analyzing SCC {l12}...
0.00/0.08	No cycles found.
0.00/0.08	
0.00/0.08	Program Terminates
0.00/0.08	EOF