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_N -> 10, main_x -> 0, main_y -> 0, main_i -> 0}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l23, not((main_i < main_N))>
0.00/0.06	<l2, l3, (main_i < main_N)>
0.00/0.06	<l3, l4, true, seq{main_i -> (main_i + 1), main_r -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l4, l22, not((main_r >= 0))>
0.00/0.06	<l4, l5, (main_r >= 0)>
0.00/0.06	<l5, l6, (main_r <= 3)>
0.00/0.06	<l5, l22, not((main_r <= 3))>
0.00/0.06	<l6, l9, not((main_r = 0))>
0.00/0.06	<l6, l7, (main_r = 0)>
0.00/0.06	<l7, l8, true, seq{main_x -> (main_x + 1)}>
0.00/0.06	<l8, l21, true>
0.00/0.06	<l9, l10, (main_r = 1)>
0.00/0.06	<l9, l12, not((main_r = 1))>
0.00/0.06	<l10, l11, true, seq{main_x -> (main_x - 1)}>
0.00/0.06	<l11, l20, true>
0.00/0.06	<l12, l13, (main_r = 2)>
0.00/0.06	<l12, l15, not((main_r = 2))>
0.00/0.06	<l13, l14, true, seq{main_y -> (main_y + 1)}>
0.00/0.06	<l14, l19, true>
0.00/0.06	<l15, l16, (main_r = 3)>
0.00/0.06	<l15, l18, not((main_r = 3))>
0.00/0.06	<l16, l17, true, seq{main_y -> (main_y - 1)}>
0.00/0.06	<l17, l18, true>
0.00/0.06	<l18, l19, true>
0.00/0.06	<l19, l20, true>
0.00/0.06	<l20, l21, true>
0.00/0.06	<l21, l22, true>
0.00/0.06	<l22, l2, true>
0.00/0.06	<l23, l24, 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, l1, true, seq{main__func_return_ -> 0, main_N -> 10, main_x -> 0, main_y -> 0, main_i -> 0}>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l2, l3, (main_i < main_N)>
0.00/0.06	<l2, l23, not((main_i < main_N))>
0.00/0.06	<l3, l25, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l25, l26, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l26, l4, true, seq{main_r -> varCall_1}>
0.00/0.06	<l4, l5, (main_r >= 0)>
0.00/0.06	<l4, l22, not((main_r >= 0))>
0.00/0.06	<l5, l6, (main_r <= 3)>
0.00/0.06	<l5, l22, not((main_r <= 3))>
0.00/0.06	<l6, l7, (main_r = 0)>
0.00/0.06	<l6, l9, not((main_r = 0))>
0.00/0.06	<l7, l8, true, seq{main_x -> (main_x + 1)}>
0.00/0.06	<l8, l21, true>
0.00/0.06	<l9, l10, (main_r = 1)>
0.00/0.06	<l9, l12, not((main_r = 1))>
0.00/0.06	<l10, l11, true, seq{main_x -> (main_x - 1)}>
0.00/0.06	<l11, l20, true>
0.00/0.06	<l12, l13, (main_r = 2)>
0.00/0.06	<l12, l15, not((main_r = 2))>
0.00/0.06	<l13, l14, true, seq{main_y -> (main_y + 1)}>
0.00/0.06	<l14, l19, true>
0.00/0.06	<l15, l16, (main_r = 3)>
0.00/0.06	<l15, l18, not((main_r = 3))>
0.00/0.06	<l16, l17, true, seq{main_y -> (main_y - 1)}>
0.00/0.06	<l17, l18, true>
0.00/0.06	<l18, l19, true>
0.00/0.06	<l19, l20, true>
0.00/0.06	<l20, l21, true>
0.00/0.06	<l21, l22, true>
0.00/0.06	<l22, l2, true>
0.00/0.06	<l23, l24, 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	24, 
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 [7 idents]:
0.00/0.06	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 21, col: 7>
0.00/0.06	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.06	N | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 19, col: 13>
0.00/0.06	x | local variable | integer | <line: 14, col: 5> | <line: 16, col: 5> <line: 24, col: 5> <line: 24, col: 9> <line: 26, col: 5> <line: 26, col: 9>
0.00/0.06	y | local variable | integer | <line: 14, col: 5> | <line: 17, col: 5> <line: 28, col: 5> <line: 28, col: 9> <line: 30, col: 5> <line: 30, col: 9>
0.00/0.06	i | local variable | integer | <line: 14, col: 5> | <line: 18, col: 5> <line: 19, col: 9> <line: 20, col: 3> <line: 20, col: 7>
0.00/0.06	r | local variable | integer | <line: 14, col: 5> | <line: 21, col: 3> <line: 22, col: 7> <line: 22, col: 17> <line: 23, col: 8> <line: 25, col: 16> <line: 27, col: 16> <line: 29, col: 16>
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, (10 = 10) /\ (main_x = 0) /\ (main_y = 0) /\ (main_i = 0)>
0.00/0.06	<l2, l2, (main_i < 10) /\ (undef2 >= 0) /\ (undef2 <= 3) /\ (undef2 = 0), par{main_x -> (main_x + 1), main_i -> (main_i + 1), main_r -> undef2}>
0.00/0.06	<l2, l2, (main_i < 10) /\ (undef2 >= 0) /\ (undef2 <= 3) /\ (undef2 > 0) /\ (undef2 = 1), par{main_x -> (main_x - 1), main_i -> (main_i + 1), main_r -> undef2}>
0.00/0.06	<l2, l2, (main_i < 10) /\ (undef2 >= 0) /\ (undef2 <= 3) /\ (undef2 > 0) /\ (undef2 > 1) /\ (undef2 = 2), par{main_y -> (main_y + 1), main_i -> (main_i + 1), main_r -> undef2}>
0.00/0.06	<l2, l2, (main_i < 10) /\ (undef2 >= 0) /\ (undef2 <= 3) /\ (undef2 > 0) /\ (undef2 > 1) /\ (undef2 > 2) /\ (undef2 = 3), par{main_y -> (main_y - 1), main_i -> (main_i + 1), main_r -> undef2}>
0.00/0.06	<l2, l2, (main_i < 10) /\ (undef2 >= 0) /\ not((undef2 <= 3)), par{main_i -> (main_i + 1), main_r -> undef2}>
0.00/0.06	<l2, l2, (main_i < 10) /\ not((undef2 >= 0)), par{main_i -> (main_i + 1), main_r -> undef2}>
0.00/0.06	<l2, l24, not((main_i < 10))>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef2, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef2, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	24, 
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, main_i <= 9 /\ undef2 = 0, {main_x -> 1 + main_x, main_i -> 1 + main_i, main_r -> undef2, rest remain the same}>
0.00/0.06	<l2, l2, main_i <= 9 /\ undef2 = 1, {main_x -> -1 + main_x, main_i -> 1 + main_i, main_r -> undef2, rest remain the same}>
0.00/0.06	<l2, l2, main_i <= 9 /\ undef2 = 2, {main_y -> 1 + main_y, main_i -> 1 + main_i, main_r -> undef2, rest remain the same}>
0.00/0.06	<l2, l2, main_i <= 9 /\ undef2 = 3, {main_y -> -1 + main_y, main_i -> 1 + main_i, main_r -> undef2, rest remain the same}>
0.00/0.06	<l2, l2, main_i <= 9 /\ 4 <= undef2, {main_i -> 1 + main_i, main_r -> undef2, rest remain the same}>
0.00/0.06	<l2, l2, 1 + undef2 <= 0 /\ main_i <= 9, {main_i -> 1 + main_i, main_r -> undef2, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_x, main_i, main_r, 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 = 0 /\ main_y = 0 /\ main_i = 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l2, l24, 10 <= main_i, {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	( 24 , 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.01978
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.003713s
0.00/0.06	Ranking function: 9 - main_i
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Analyzing SCC {l24}...
0.00/0.06	No cycles found.
0.00/0.06	
0.00/0.06	Program Terminates
0.00/0.06	EOF