0.00/0.04	YES
0.00/0.04	
0.00/0.04	Solver Timeout: 4
0.00/0.04	Global Timeout: 300
0.00/0.04	Maximum number of concurrent processes: 900
0.00/0.04	*******************************************************************************************
0.00/0.04	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	
0.00/0.04	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.04	
0.00/0.04	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.04	+                                                                  +
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_tx -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_ty -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l1, l2, ((main_x + main_y) >= 0)>
0.00/0.04	<l1, l14, not(((main_x + main_y) >= 0))>
0.00/0.04	<l2, l3, true>
0.00/0.04	<l3, l13, not((main_x <= main_n))>
0.00/0.04	<l3, l4, (main_x <= main_n)>
0.00/0.04	<l4, l13, not((main_x >= ((2 * main_tx) + main_y)))>
0.00/0.04	<l4, l5, (main_x >= ((2 * main_tx) + main_y))>
0.00/0.04	<l5, l13, not((main_y >= (main_ty + 1)))>
0.00/0.04	<l5, l6, (main_y >= (main_ty + 1))>
0.00/0.04	<l6, l7, (main_x >= (main_tx + 1))>
0.00/0.04	<l6, l13, not((main_x >= (main_tx + 1)))>
0.00/0.04	<l7, l8, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
0.00/0.04	<l7, l10, (¿functionCall(__VERIFIER_nondet_int) = 0)>
0.00/0.04	<l8, l9, true, seq{main_tx -> main_x, main_ty -> main_y, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l9, l12, true>
0.00/0.04	<l10, l11, true, seq{main_tx -> main_x, main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l11, l12, true>
0.00/0.04	<l12, l3, true>
0.00/0.04	<l13, l14, true>
0.00/0.04	<l14, l15, true, seq{main__func_return_ -> 0}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.04	       
0.00/0.04	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.04	       
0.00/0.04	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l16, true, seq{main__func_return_ -> 0}>
0.00/0.04	<l16, l17, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l17, l18, true, seq{main_x -> varCall_1}>
0.00/0.04	<l18, l19, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l19, l20, true, seq{main_tx -> varCall_2}>
0.00/0.04	<l20, l21, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l21, l22, true, seq{main_y -> varCall_3}>
0.00/0.04	<l22, l23, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l23, l24, true, seq{main_ty -> varCall_4}>
0.00/0.04	<l24, l25, true, seq{varCall_5 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l25, l1, true, seq{main_n -> varCall_5}>
0.00/0.04	<l1, l2, ((main_x + main_y) >= 0)>
0.00/0.04	<l1, l14, not(((main_x + main_y) >= 0))>
0.00/0.04	<l2, l3, true>
0.00/0.04	<l3, l4, (main_x <= main_n)>
0.00/0.04	<l3, l13, not((main_x <= main_n))>
0.00/0.04	<l4, l5, (main_x >= ((2 * main_tx) + main_y))>
0.00/0.04	<l4, l13, not((main_x >= ((2 * main_tx) + main_y)))>
0.00/0.04	<l5, l6, (main_y >= (main_ty + 1))>
0.00/0.04	<l5, l13, not((main_y >= (main_ty + 1)))>
0.00/0.04	<l6, l7, (main_x >= (main_tx + 1))>
0.00/0.04	<l6, l13, not((main_x >= (main_tx + 1)))>
0.00/0.04	<l7, l26, true, seq{varCall_6 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l26, l10, (varCall_6 = 0)>
0.00/0.04	<l26, l8, (varCall_6 = 1)>
0.00/0.04	<l8, l27, true, seq{main_tx -> main_x, main_ty -> main_y}>
0.00/0.04	<l27, l28, true, seq{varCall_7 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l28, l29, true, seq{main_x -> varCall_7}>
0.00/0.04	<l29, l30, true, seq{varCall_8 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l30, l9, true, seq{main_y -> varCall_8}>
0.00/0.04	<l9, l12, true>
0.00/0.04	<l10, l31, true, seq{main_tx -> main_x}>
0.00/0.04	<l31, l32, true, seq{varCall_9 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l32, l11, true, seq{main_x -> varCall_9}>
0.00/0.04	<l11, l12, true>
0.00/0.04	<l12, l3, true>
0.00/0.04	<l13, l14, true>
0.00/0.04	<l14, l15, true, seq{main__func_return_ -> 0}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	15, 
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	+                                                                  +
0.00/0.04	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.04	
0.00/0.04	
0.00/0.04	Function Return and Parameters Information [2 functions]:
0.00/0.04	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.04	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.04	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.04	        main__func_return_      [function result] : int
0.00/0.04	
0.00/0.04	
0.00/0.04	AST Ident Scanner Information [7 idents]:
0.00/0.04	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 7> <line: 17, col: 6> <line: 18, col: 7> <line: 19, col: 6> <line: 22, col: 8> <line: 25, col: 9> <line: 26, col: 9> <line: 29, col: 9>
0.00/0.04	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.04	x | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 20, col: 6> <line: 21, col: 10> <line: 21, col: 20> <line: 21, col: 54> <line: 23, col: 10> <line: 25, col: 5> <line: 28, col: 10> <line: 29, col: 5>
0.00/0.04	tx | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 21, col: 29> <line: 21, col: 59> <line: 23, col: 5> <line: 28, col: 5>
0.00/0.04	y | local variable | integer | <line: 14, col: 5> | <line: 17, col: 2> <line: 20, col: 10> <line: 21, col: 34> <line: 21, col: 39> <line: 24, col: 10> <line: 26, col: 5>
0.00/0.04	ty | local variable | integer | <line: 14, col: 5> | <line: 18, col: 2> <line: 21, col: 44> <line: 24, col: 5>
0.00/0.04	n | local variable | integer | <line: 14, col: 5> | <line: 19, col: 2> <line: 21, col: 15>
0.00/0.04	
0.00/0.04	Main function: main
0.00/0.04	Preprocessed LLVMGraph
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l3, (main_x = undef10) /\ (main_tx = undef11) /\ (main_y = undef12) /\ (main_ty = undef13) /\ (main_n = undef14) /\ ((undef10 + undef12) >= 0)>
0.00/0.04	<l0, l15, (main_x = undef10) /\ (main_tx = undef11) /\ (main_y = undef12) /\ (main_ty = undef13) /\ (main_n = undef14) /\ not(((undef10 + undef12) >= 0))>
0.00/0.04	<l3, l3, (main_x <= main_n) /\ (main_x >= ((2 * main_tx) + main_y)) /\ (main_y >= (main_ty + 1)) /\ (main_x >= (main_tx + 1)) /\ (undef15 = 0), par{main_x -> undef18, main_tx -> main_x}>
0.00/0.04	<l3, l3, (main_x <= main_n) /\ (main_x >= ((2 * main_tx) + main_y)) /\ (main_y >= (main_ty + 1)) /\ (main_x >= (main_tx + 1)) /\ (undef15 = 1), par{main_x -> undef16, main_tx -> main_x, main_y -> undef17, main_ty -> main_y}>
0.00/0.04	<l3, l15, (main_x <= main_n) /\ (main_x >= ((2 * main_tx) + main_y)) /\ (main_y >= (main_ty + 1)) /\ not((main_x >= (main_tx + 1)))>
0.00/0.04	<l3, l15, (main_x <= main_n) /\ (main_x >= ((2 * main_tx) + main_y)) /\ not((main_y >= (main_ty + 1)))>
0.00/0.04	<l3, l15, (main_x <= main_n) /\ not((main_x >= ((2 * main_tx) + main_y)))>
0.00/0.04	<l3, l15, not((main_x <= main_n))>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	15, 
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	*************************************************************
0.00/0.04	*******************************************************************************************
0.00/0.04	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Graph 0:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Graph 1:
0.00/0.04	Transitions:
0.00/0.04	<l3, l3, main_x <= main_n /\ 2*main_tx + main_y <= main_x /\ 1 + main_tx <= main_x /\ 1 + main_ty <= main_y /\ undef15 = 0, {main_x -> undef18, main_tx -> main_x, rest remain the same}>
0.00/0.04	<l3, l3, main_x <= main_n /\ 2*main_tx + main_y <= main_x /\ 1 + main_tx <= main_x /\ 1 + main_ty <= main_y /\ undef15 = 1, {main_x -> undef16, main_tx -> main_x, main_y -> undef17, main_ty -> main_y, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_x, main_tx, main_y, main_ty, main_n
0.00/0.04	
0.00/0.04	Graph 2:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Precedence: 
0.00/0.04	Graph 0
0.00/0.04	
0.00/0.04	Graph 1
0.00/0.04	<l0, l3, 0 <= undef10 + undef12 /\ main_x = undef10 /\ main_tx = undef11 /\ main_y = undef12 /\ main_ty = undef13 /\ main_n = undef14, {all remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l0, l15, 1 + undef10 + undef12 <= 0 /\ main_x = undef10 /\ main_tx = undef11 /\ main_y = undef12 /\ main_ty = undef13 /\ main_n = undef14, {all remain the same}>
0.00/0.04	<l3, l15, main_x <= main_tx /\ main_x <= main_n /\ 2*main_tx + main_y <= main_x /\ 1 + main_ty <= main_y, {all remain the same}>
0.00/0.04	<l3, l15, main_x <= main_n /\ 2*main_tx + main_y <= main_x /\ main_y <= main_ty, {all remain the same}>
0.00/0.04	<l3, l15, main_x <= main_n /\ 1 + main_x <= 2*main_tx + main_y, {all remain the same}>
0.00/0.04	<l3, l15, 1 + main_n <= main_x, {all remain the same}>
0.00/0.04	
0.00/0.04	Map Locations to Subgraph:
0.00/0.04	( 0 , 0 )
0.00/0.04	( 3 , 1 )
0.00/0.04	( 15 , 2 )
0.00/0.04	
0.00/0.04	*******************************************************************************************
0.00/0.04	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Proving termination of subgraph 0
0.00/0.04	Proving termination of subgraph 1
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.007496
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l3}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.002420s
0.00/0.04	Ranking function: 1 + (~(2) / 3)*main_tx + (~(1) / 3)*main_ty + (1 / 3)*main_n
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Analyzing SCC {l15}...
0.00/0.04	No cycles found.
0.00/0.04	
0.00/0.04	Program Terminates
0.00/0.04	EOF