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, l13, not((main_x >= 0))>
0.00/0.06	<l1, l2, (main_x >= 0)>
0.00/0.06	<l2, l3, (main_y >= 0)>
0.00/0.06	<l2, l13, not((main_y >= 0))>
0.00/0.06	<l3, l4, true>
0.00/0.06	<l4, l5, not(((main_x - main_y) > 2))>
0.00/0.06	<l4, l6, ((main_x - main_y) > 2)>
0.00/0.06	<l5, l12, not(((main_y - main_x) > 2))>
0.00/0.06	<l5, l6, ((main_y - main_x) > 2)>
0.00/0.06	<l6, l7, (main_x < main_y)>
0.00/0.07	<l6, l9, not((main_x < main_y))>
0.00/0.07	<l7, l8, true, seq{main_x -> (main_x + 1)}>
0.00/0.07	<l8, l11, true>
0.00/0.07	<l9, l10, true, seq{main_y -> (main_y + 1)}>
0.00/0.07	<l10, l11, true>
0.00/0.07	<l11, l4, true>
0.00/0.07	<l12, l13, true>
0.00/0.07	<l13, l14, true, seq{main__func_return_ -> 0}>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.07	       
0.00/0.07	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.07	       
0.00/0.07	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.07	
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l15, true, seq{main__func_return_ -> 0}>
0.00/0.07	<l15, l16, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.07	<l16, l17, true, seq{main_x -> varCall_1}>
0.00/0.07	<l17, l18, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.07	<l18, l1, true, seq{main_y -> varCall_2}>
0.00/0.07	<l1, l2, (main_x >= 0)>
0.00/0.07	<l1, l13, not((main_x >= 0))>
0.00/0.07	<l2, l3, (main_y >= 0)>
0.00/0.07	<l2, l13, not((main_y >= 0))>
0.00/0.07	<l3, l4, true>
0.00/0.07	<l4, l6, ((main_x - main_y) > 2)>
0.00/0.07	<l4, l5, not(((main_x - main_y) > 2))>
0.00/0.07	<l5, l6, ((main_y - main_x) > 2)>
0.00/0.07	<l5, l12, not(((main_y - main_x) > 2))>
0.00/0.07	<l6, l7, (main_x < main_y)>
0.00/0.07	<l6, l9, not((main_x < main_y))>
0.00/0.07	<l7, l8, true, seq{main_x -> (main_x + 1)}>
0.00/0.07	<l8, l11, true>
0.00/0.07	<l9, l10, true, seq{main_y -> (main_y + 1)}>
0.00/0.07	<l10, l11, true>
0.00/0.07	<l11, l4, true>
0.00/0.07	<l12, l13, true>
0.00/0.07	<l13, l14, true, seq{main__func_return_ -> 0}>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	14, 
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	+                                                                  +
0.00/0.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.07	
0.00/0.07	
0.00/0.07	Function Return and Parameters Information [2 functions]:
0.00/0.07	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.07	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.07	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.07	        main__func_return_      [function result] : int
0.00/0.07	
0.00/0.07	
0.00/0.07	AST Ident Scanner Information [4 idents]:
0.00/0.07	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 6>
0.00/0.07	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.07	x | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 17, col: 6> <line: 18, col: 10> <line: 18, col: 27> <line: 19, col: 8> <line: 20, col: 5> <line: 20, col: 9>
0.00/0.07	y | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 17, col: 16> <line: 18, col: 14> <line: 18, col: 23> <line: 19, col: 12> <line: 22, col: 5> <line: 22, col: 9>
0.00/0.07	
0.00/0.07	Main function: main
0.00/0.07	Preprocessed LLVMGraph
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l4, (main_x = undef3) /\ (main_y = undef4) /\ (undef3 >= 0) /\ (undef4 >= 0)>
0.00/0.07	<l0, l14, (main_x = undef3) /\ (main_y = undef4) /\ (undef3 >= 0) /\ not((undef4 >= 0))>
0.00/0.07	<l0, l14, (main_x = undef3) /\ (main_y = undef4) /\ not((undef3 >= 0))>
0.00/0.07	<l4, l4, ((main_x - main_y) > 2) /\ not((main_x < main_y)), par{main_y -> (main_y + 1)}>
0.00/0.07	<l4, l4, not(((main_x - main_y) > 2)) /\ ((main_y - main_x) > 2) /\ (main_x < main_y), par{main_x -> (main_x + 1)}>
0.00/0.07	<l4, l14, not(((main_x - main_y) > 2)) /\ not(((main_y - main_x) > 2))>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	undef3, undef4, 
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	undef3, undef4, 
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	14, 
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	*************************************************************
0.00/0.07	*******************************************************************************************
0.00/0.07	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Init Location: 0
0.00/0.07	Graph 0:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Graph 1:
0.00/0.07	Transitions:
0.00/0.07	<l4, l4, 3 + main_y <= main_x, {main_y -> 1 + main_y, rest remain the same}>
0.00/0.07	<l4, l4, 3 + main_x <= main_y, {main_x -> 1 + main_x, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	main_x, main_y
0.00/0.07	
0.00/0.07	Graph 2:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Precedence: 
0.00/0.07	Graph 0
0.00/0.07	
0.00/0.07	Graph 1
0.00/0.07	<l0, l4, 0 <= undef3 /\ 0 <= undef4 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.07	
0.00/0.07	Graph 2
0.00/0.07	<l0, l14, 0 <= undef3 /\ 1 + undef4 <= 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.07	<l0, l14, 1 + undef3 <= 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.07	<l4, l14, main_x <= 2 + main_y /\ main_y <= 2 + main_x, {all remain the same}>
0.00/0.07	
0.00/0.07	Map Locations to Subgraph:
0.00/0.07	( 0 , 0 )
0.00/0.07	( 4 , 1 )
0.00/0.07	( 14 , 2 )
0.00/0.07	
0.00/0.07	*******************************************************************************************
0.00/0.07	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Proving termination of subgraph 0
0.00/0.07	Proving termination of subgraph 1
0.00/0.07	Checking unfeasibility...
0.00/0.07	Time used: 0.003776
0.00/0.07	
0.00/0.07	Checking conditional termination of SCC {l4}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.000850s
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.017304s
0.00/0.07	[45211 : 45213]
0.00/0.07	[45211 : 45214]
0.00/0.07	Successful child: 45214
0.00/0.07	Ranking function: -main_x + main_y
0.00/0.07	Ranking function and negation of Quasi-Invariant applied
0.00/0.07	New Graphs: 
0.00/0.07	Transitions:
0.00/0.07	<l4, l4, 3 + main_y <= main_x, {main_y -> 1 + main_y, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	main_x, main_y
0.00/0.07	Checking conditional termination of SCC {l4}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.000687s
0.00/0.07	Ranking function: -3 + main_x - main_y
0.00/0.07	New Graphs: 
0.00/0.07	Proving termination of subgraph 2
0.00/0.07	Analyzing SCC {l14}...
0.00/0.07	No cycles found.
0.00/0.07	
0.00/0.07	Program Terminates
0.00/0.07	EOF