0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	Maximum number of concurrent processes: 900
0.00/0.06	*******************************************************************************************
0.00/0.06	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	
0.00/0.06	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.06	
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	+                                                                  +
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l20, not((main_x > 0))>
0.00/0.06	<l2, l3, (main_x > 0)>
0.00/0.06	<l3, l20, not((main_y > 0))>
0.00/0.06	<l3, l4, (main_y > 0)>
0.00/0.06	<l4, l5, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
0.00/0.06	<l4, l12, (¿functionCall(__VERIFIER_nondet_int) = 0)>
0.00/0.06	<l5, l6, (main_x < main_y)>
0.00/0.06	<l5, l8, not((main_x < main_y))>
0.00/0.06	<l6, l7, true, seq{main_y -> (main_x - 1)}>
0.00/0.06	<l7, l10, true>
0.00/0.06	<l8, l9, true, seq{main_y -> (main_y - 1)}>
0.00/0.06	<l9, l10, true>
0.00/0.06	<l10, l11, true, seq{main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l11, l19, true>
0.00/0.06	<l12, l13, (main_x < main_y)>
0.00/0.06	<l12, l15, not((main_x < main_y))>
0.00/0.06	<l13, l14, true, seq{main_x -> (main_x - 1)}>
0.00/0.06	<l14, l17, true>
0.00/0.06	<l15, l16, true, seq{main_x -> (main_y - 1)}>
0.00/0.06	<l16, l17, true>
0.00/0.06	<l17, l18, true, seq{main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l18, l19, true>
0.00/0.06	<l19, l2, true>
0.00/0.06	<l20, l21, true, seq{main__func_return_ -> 0}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l22, true, seq{main__func_return_ -> 0}>
0.00/0.06	<l22, l23, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l23, l24, true, seq{main_x -> varCall_1}>
0.00/0.06	<l24, l25, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l25, l1, true, seq{main_y -> varCall_2}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l3, (main_x > 0)>
0.00/0.06	<l2, l20, not((main_x > 0))>
0.00/0.06	<l3, l4, (main_y > 0)>
0.00/0.06	<l3, l20, not((main_y > 0))>
0.00/0.06	<l4, l26, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l26, l12, (varCall_3 = 0)>
0.00/0.06	<l26, l5, (varCall_3 = 1)>
0.00/0.06	<l5, l6, (main_x < main_y)>
0.00/0.06	<l5, l8, not((main_x < main_y))>
0.00/0.06	<l6, l7, true, seq{main_y -> (main_x - 1)}>
0.00/0.06	<l7, l10, true>
0.00/0.06	<l8, l9, true, seq{main_y -> (main_y - 1)}>
0.00/0.06	<l9, l10, true>
0.00/0.06	<l10, l27, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l27, l11, true, seq{main_x -> varCall_4}>
0.00/0.06	<l11, l19, true>
0.00/0.06	<l12, l13, (main_x < main_y)>
0.00/0.06	<l12, l15, not((main_x < main_y))>
0.00/0.06	<l13, l14, true, seq{main_x -> (main_x - 1)}>
0.00/0.06	<l14, l17, true>
0.00/0.06	<l15, l16, true, seq{main_x -> (main_y - 1)}>
0.00/0.06	<l16, l17, true>
0.00/0.06	<l17, l28, true, seq{varCall_5 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l28, l18, true, seq{main_y -> varCall_5}>
0.00/0.06	<l18, l19, true>
0.00/0.06	<l19, l2, true>
0.00/0.06	<l20, l21, true, seq{main__func_return_ -> 0}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	21, 
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+                                                                  +
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	
0.00/0.06	Function Return and Parameters Information [2 functions]:
0.00/0.06	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.06	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.06	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.06	        main__func_return_      [function result] : int
0.00/0.06	
0.00/0.06	
0.00/0.06	AST Ident Scanner Information [4 idents]:
0.00/0.06	__VERIFIER_nondet_int | function | [integer, ()] | <line: 17, col: 1> | <line: 22, col: 6> <line: 23, col: 6> <line: 25, col: 10> <line: 31, col: 11> <line: 38, col: 11>
0.00/0.06	main | function | [integer, ()] | <line: 19, col: 1>
0.00/0.06	x | local variable | integer | <line: 20, col: 2> | <line: 22, col: 2> <line: 24, col: 12> <line: 26, col: 11> <line: 27, col: 12> <line: 31, col: 7> <line: 33, col: 11> <line: 34, col: 8> <line: 34, col: 12> <line: 36, col: 8>
0.00/0.06	y | local variable | integer | <line: 21, col: 2> | <line: 23, col: 2> <line: 24, col: 21> <line: 26, col: 13> <line: 27, col: 8> <line: 29, col: 8> <line: 29, col: 12> <line: 33, col: 13> <line: 36, col: 12> <line: 38, col: 7>
0.00/0.06	
0.00/0.06	Main function: main
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l2, (main_x = undef6) /\ (main_y = undef7)>
0.00/0.06	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef8 = 0) /\ (main_x < main_y), par{main_x -> (main_x - 1), main_y -> undef10}>
0.00/0.06	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef8 = 0) /\ not((main_x < main_y)), par{main_x -> (main_y - 1), main_y -> undef10}>
0.00/0.06	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef8 = 1) /\ (main_x < main_y), par{main_x -> undef9, main_y -> (main_x - 1)}>
0.00/0.06	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (undef8 = 1) /\ not((main_x < main_y)), par{main_x -> undef9, main_y -> (main_y - 1)}>
0.00/0.06	<l2, l21, (main_x > 0) /\ not((main_y > 0))>
0.00/0.06	<l2, l21, not((main_x > 0))>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef6, undef7, undef8, undef9, undef10, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef6, undef7, undef8, undef9, undef10, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	21, 
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y /\ undef8 = 0, {main_x -> -1 + main_x, main_y -> undef10, rest remain the same}>
0.00/0.06	<l2, l2, main_y <= main_x /\ 1 <= main_x /\ 1 <= main_y /\ undef8 = 0, {main_x -> -1 + main_y, main_y -> undef10, rest remain the same}>
0.00/0.06	<l2, l2, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y /\ undef8 = 1, {main_x -> undef9, main_y -> -1 + main_x, rest remain the same}>
0.00/0.06	<l2, l2, main_y <= main_x /\ 1 <= main_x /\ 1 <= main_y /\ undef8 = 1, {main_x -> undef9, main_y -> -1 + main_y, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_x, main_y
0.00/0.06	
0.00/0.06	Graph 2:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l2, main_x = undef6 /\ main_y = undef7, {all remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l2, l21, main_y <= 0 /\ 1 <= main_x, {all remain the same}>
0.00/0.06	<l2, l21, main_x <= 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 2 , 1 )
0.00/0.06	( 21 , 2 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.008448
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l2}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.002325s
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.017440s
0.00/0.06	Piecewise ranking function: min(-2 + 2*main_y,-2 + 2*main_x)
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Analyzing SCC {l21}...
0.00/0.06	No cycles found.
0.00/0.06	
0.00/0.06	Program Terminates
0.00/0.06	EOF