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 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l1, l2, true>
0.00/0.09	<l2, l18, (main_x = 0)>
0.00/0.09	<l2, l3, not((main_x = 0))>
0.00/0.09	<l3, l18, not((main_y > 0))>
0.00/0.09	<l3, l4, (main_y > 0)>
0.00/0.09	<l4, l5, (main_x > 0)>
0.00/0.09	<l4, l11, not((main_x > 0))>
0.00/0.09	<l5, l6, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
0.00/0.09	<l5, l8, (¿functionCall(__VERIFIER_nondet_int) = 0)>
0.00/0.09	<l6, l7, true, seq{main_x -> (main_x - 1), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l7, l10, true>
0.00/0.09	<l8, l9, true, seq{main_y -> (main_y - 1)}>
0.00/0.09	<l9, l10, true>
0.00/0.09	<l10, l17, true>
0.00/0.09	<l11, l12, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
0.00/0.09	<l11, l14, (¿functionCall(__VERIFIER_nondet_int) = 0)>
0.00/0.09	<l12, l13, true, seq{main_x -> (main_x + 1)}>
0.00/0.09	<l13, l16, true>
0.00/0.09	<l14, l15, true, seq{main_y -> (main_y - 1), main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l15, l16, true>
0.00/0.09	<l16, l17, true>
0.00/0.09	<l17, l2, true>
0.00/0.09	<l18, l19, 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, l20, true, seq{main__func_return_ -> 0}>
0.00/0.09	<l20, l21, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l21, l22, true, seq{main_x -> varCall_1}>
0.00/0.09	<l22, l23, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l23, l1, true, seq{main_y -> varCall_2}>
0.00/0.09	<l1, l2, true>
0.00/0.09	<l2, l18, (main_x = 0)>
0.00/0.09	<l2, l3, not((main_x = 0))>
0.00/0.09	<l3, l4, (main_y > 0)>
0.00/0.09	<l3, l18, not((main_y > 0))>
0.00/0.09	<l4, l5, (main_x > 0)>
0.00/0.09	<l4, l11, not((main_x > 0))>
0.00/0.09	<l5, l24, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l24, l8, (varCall_3 = 0)>
0.00/0.09	<l24, l6, (varCall_3 = 1)>
0.00/0.09	<l6, l25, true, seq{main_x -> (main_x - 1)}>
0.00/0.09	<l25, l26, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l26, l7, true, seq{main_y -> varCall_4}>
0.00/0.09	<l7, l10, true>
0.00/0.09	<l8, l9, true, seq{main_y -> (main_y - 1)}>
0.00/0.09	<l9, l10, true>
0.00/0.09	<l10, l17, true>
0.00/0.09	<l11, l27, true, seq{varCall_5 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l27, l14, (varCall_5 = 0)>
0.00/0.09	<l27, l12, (varCall_5 = 1)>
0.00/0.09	<l12, l13, true, seq{main_x -> (main_x + 1)}>
0.00/0.09	<l13, l16, true>
0.00/0.09	<l14, l28, true, seq{main_y -> (main_y - 1)}>
0.00/0.09	<l28, l29, true, seq{varCall_6 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.09	<l29, l15, true, seq{main_x -> varCall_6}>
0.00/0.09	<l15, l16, true>
0.00/0.09	<l16, l17, true>
0.00/0.09	<l17, l2, true>
0.00/0.09	<l18, l19, 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	19, 
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 [4 idents]:
0.00/0.09	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 16, col: 6> <line: 17, col: 6> <line: 20, col: 11> <line: 22, col: 9> <line: 27, col: 11> <line: 31, col: 9>
0.00/0.09	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.09	x | local variable | integer | <line: 14, col: 2> | <line: 16, col: 2> <line: 18, col: 9> <line: 19, col: 10> <line: 21, col: 8> <line: 21, col: 12> <line: 28, col: 8> <line: 28, col: 12> <line: 31, col: 5>
0.00/0.09	y | local variable | integer | <line: 15, col: 2> | <line: 17, col: 2> <line: 18, col: 19> <line: 22, col: 5> <line: 24, col: 8> <line: 24, col: 12> <line: 30, col: 8> <line: 30, col: 12>
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 = undef7) /\ (main_y = undef8)>
0.00/0.09	<l2, l19, (main_x = 0)>
0.00/0.09	<l2, l2, (main_x < 0) /\ (main_y > 0) /\ not((main_x > 0)) /\ (undef11 = 0), par{main_x -> undef12, main_y -> (main_y - 1)}>
0.00/0.09	<l2, l2, (main_x < 0) /\ (main_y > 0) /\ not((main_x > 0)) /\ (undef11 = 1), par{main_x -> (main_x + 1)}>
0.00/0.09	<l2, l19, (main_x < 0) /\ not((main_y > 0))>
0.00/0.09	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (main_x > 0) /\ (undef9 = 0), par{main_y -> (main_y - 1)}>
0.00/0.09	<l2, l2, (main_x > 0) /\ (main_y > 0) /\ (main_x > 0) /\ (undef9 = 1), par{main_x -> (main_x - 1), main_y -> undef10}>
0.00/0.09	<l2, l19, (main_x > 0) /\ not((main_y > 0))>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	undef7, undef8, undef9, undef10, undef11, undef12, 
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	undef7, undef8, undef9, undef10, undef11, undef12, 
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	19, 
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, 1 + main_x <= 0 /\ 1 <= main_y /\ undef11 = 0, {main_x -> undef12, main_y -> -1 + main_y, rest remain the same}>
0.00/0.09	<l2, l2, 1 + main_x <= 0 /\ 1 <= main_y /\ undef11 = 1, {main_x -> 1 + main_x, rest remain the same}>
0.00/0.09	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef9 = 0, {main_y -> -1 + main_y, rest remain the same}>
0.00/0.09	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef9 = 1, {main_x -> -1 + main_x, main_y -> undef10, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	main_x, main_y
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 = undef7 /\ main_y = undef8, {all remain the same}>
0.00/0.09	
0.00/0.09	Graph 2
0.00/0.09	<l2, l19, main_x = 0, {all remain the same}>
0.00/0.09	<l2, l19, main_y <= 0 /\ 1 + main_x <= 0, {all remain the same}>
0.00/0.09	<l2, l19, main_y <= 0 /\ 1 <= main_x, {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	( 19 , 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.00759
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.001946s
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.011872s
0.00/0.09	[17486 : 17488]
0.00/0.09	[17486 : 17489]
0.00/0.09	Successful child: 17489
0.00/0.09	Ranking function: main_x
0.00/0.09	Ranking function and negation of Quasi-Invariant applied
0.00/0.09	New Graphs: 
0.00/0.09	Transitions:
0.00/0.09	<l2, l2, 1 + main_x <= 0 /\ 1 <= main_y /\ undef11 = 0, {main_x -> undef12, main_y -> -1 + main_y, rest remain the same}>
0.00/0.09	<l2, l2, 1 + main_x <= 0 /\ 1 <= main_y /\ undef11 = 1, {main_x -> 1 + main_x, rest remain the same}>
0.00/0.09	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ undef9 = 0, {main_y -> -1 + main_y, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	main_x, main_y
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.001923s
0.00/0.09	Ranking function: -1 + main_y
0.00/0.09	New Graphs: 
0.00/0.09	Transitions:
0.00/0.09	<l2, l2, 1 + main_x <= 0 /\ 1 <= main_y /\ undef11 = 1, {main_x -> 1 + main_x, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	main_x, main_y
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.000822s
0.00/0.10	Ranking function: -1 - main_x
0.00/0.10	New Graphs: 
0.00/0.10	Proving termination of subgraph 2
0.00/0.10	Analyzing SCC {l19}...
0.00/0.10	No cycles found.
0.00/0.10	
0.00/0.10	Program Terminates
0.00/0.10	EOF