0.00/0.23	YES
0.00/0.23	
0.00/0.23	Solver Timeout: 4
0.00/0.23	Global Timeout: 300
0.00/0.23	Maximum number of concurrent processes: 900
0.00/0.23	*******************************************************************************************
0.00/0.23	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.23	*******************************************************************************************
0.00/0.23	
0.00/0.23	
0.00/0.23	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.23	
0.00/0.23	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.23	+                                                                  +
0.00/0.23	Init Location: 0
0.00/0.23	Transitions:
0.00/0.23	<l0, l1, true, seq{main__func_return_ -> 0, main_n -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int), main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l1, l2, true>
0.00/0.23	<l2, l17, not((main_x >= 0))>
0.00/0.23	<l2, l3, (main_x >= 0)>
0.00/0.23	<l3, l17, not((0 <= main_y))>
0.00/0.23	<l3, l4, (0 <= main_y)>
0.00/0.23	<l4, l17, not((main_y <= main_n))>
0.00/0.23	<l4, l5, (main_y <= main_n)>
0.00/0.23	<l5, l6, (main_b = 0)>
0.00/0.23	<l5, l11, not((main_b = 0))>
0.00/0.23	<l6, l7, true, seq{main_y -> (main_y + 1)}>
0.00/0.23	<l7, l8, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
0.00/0.23	<l7, l10, (¿functionCall(__VERIFIER_nondet_int) = 0)>
0.00/0.23	<l8, l9, true, seq{main_b -> 1}>
0.00/0.23	<l9, l10, true>
0.00/0.23	<l10, l16, true>
0.00/0.23	<l11, l12, true, seq{main_y -> (main_y - 1)}>
0.00/0.23	<l12, l13, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
0.00/0.23	<l12, l15, (¿functionCall(__VERIFIER_nondet_int) = 0)>
0.00/0.23	<l13, l14, true, seq{main_x -> (main_x - 1), main_b -> 0}>
0.00/0.23	<l14, l15, true>
0.00/0.23	<l15, l16, true>
0.00/0.23	<l16, l2, true>
0.00/0.23	<l17, l18, true, seq{main__func_return_ -> 0}>
0.00/0.23	
0.00/0.23	Fresh variables:
0.00/0.23	
0.00/0.23	Undef variables:
0.00/0.23	
0.00/0.23	Abstraction variables:
0.00/0.23	
0.00/0.23	Exit nodes:
0.00/0.23	
0.00/0.23	Accepting locations:
0.00/0.23	
0.00/0.23	Asserts:
0.00/0.23	
0.00/0.23	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.23	       
0.00/0.23	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.23	       
0.00/0.23	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.23	
0.00/0.23	Init Location: 0
0.00/0.23	Transitions:
0.00/0.23	<l0, l19, true, seq{main__func_return_ -> 0}>
0.00/0.23	<l19, l20, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l20, l21, true, seq{main_n -> varCall_1}>
0.00/0.23	<l21, l22, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l22, l23, true, seq{main_b -> varCall_2}>
0.00/0.23	<l23, l24, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l24, l25, true, seq{main_x -> varCall_3}>
0.00/0.23	<l25, l26, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l26, l1, true, seq{main_y -> varCall_4}>
0.00/0.23	<l1, l2, true>
0.00/0.23	<l2, l3, (main_x >= 0)>
0.00/0.23	<l2, l17, not((main_x >= 0))>
0.00/0.23	<l3, l4, (0 <= main_y)>
0.00/0.23	<l3, l17, not((0 <= main_y))>
0.00/0.23	<l4, l5, (main_y <= main_n)>
0.00/0.23	<l4, l17, not((main_y <= main_n))>
0.00/0.23	<l5, l6, (main_b = 0)>
0.00/0.23	<l5, l11, not((main_b = 0))>
0.00/0.23	<l6, l7, true, seq{main_y -> (main_y + 1)}>
0.00/0.23	<l7, l27, true, seq{varCall_5 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l27, l10, (varCall_5 = 0)>
0.00/0.23	<l27, l8, (varCall_5 = 1)>
0.00/0.23	<l8, l9, true, seq{main_b -> 1}>
0.00/0.23	<l9, l10, true>
0.00/0.23	<l10, l16, true>
0.00/0.23	<l11, l12, true, seq{main_y -> (main_y - 1)}>
0.00/0.23	<l12, l28, true, seq{varCall_6 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.23	<l28, l15, (varCall_6 = 0)>
0.00/0.23	<l28, l13, (varCall_6 = 1)>
0.00/0.23	<l13, l14, true, seq{main_x -> (main_x - 1), main_b -> 0}>
0.00/0.23	<l14, l15, true>
0.00/0.23	<l15, l16, true>
0.00/0.23	<l16, l2, true>
0.00/0.23	<l17, l18, true, seq{main__func_return_ -> 0}>
0.00/0.23	
0.00/0.23	Fresh variables:
0.00/0.23	
0.00/0.23	Undef variables:
0.00/0.23	
0.00/0.23	Abstraction variables:
0.00/0.23	
0.00/0.23	Exit nodes:
0.00/0.23	18, 
0.00/0.23	Accepting locations:
0.00/0.23	
0.00/0.23	Asserts:
0.00/0.23	
0.00/0.23	+                                                                  +
0.00/0.23	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.23	
0.00/0.23	
0.00/0.23	Function Return and Parameters Information [2 functions]:
0.00/0.23	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.23	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.23	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.23	        main__func_return_      [function result] : int
0.00/0.23	
0.00/0.23	
0.00/0.23	AST Ident Scanner Information [6 idents]:
0.00/0.23	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 6> <line: 17, col: 6> <line: 18, col: 6> <line: 22, col: 8> <line: 27, col: 8>
0.00/0.23	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.23	x | local variable | integer | <line: 14, col: 5> | <line: 17, col: 2> <line: 19, col: 9> <line: 28, col: 5> <line: 28, col: 9>
0.00/0.23	y | local variable | integer | <line: 14, col: 5> | <line: 18, col: 2> <line: 19, col: 24> <line: 19, col: 29> <line: 21, col: 4> <line: 21, col: 8> <line: 26, col: 4> <line: 26, col: 8>
0.00/0.23	n | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 19, col: 34>
0.00/0.23	b | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 20, col: 7> <line: 23, col: 5> <line: 29, col: 5>
0.00/0.23	
0.00/0.23	Main function: main
0.00/0.23	Preprocessed LLVMGraph
0.00/0.23	Init Location: 0
0.00/0.23	Transitions:
0.00/0.23	<l0, l2, (main_x = undef9) /\ (main_y = undef10) /\ (main_n = undef7) /\ (main_b = undef8)>
0.00/0.23	<l2, l2, (main_x >= 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b = 0) /\ (undef11 = 0), par{main_y -> (main_y + 1), varCall_5 -> undef11}>
0.00/0.23	<l2, l2, (main_x >= 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b = 0) /\ (undef11 = 1), par{main_y -> (main_y + 1), main_b -> 1, varCall_5 -> undef11}>
0.00/0.23	<l2, l2, (main_x >= 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b < 0) /\ (undef12 = 0), par{main_y -> (main_y - 1), varCall_6 -> undef12}>
0.00/0.23	<l2, l2, (main_x >= 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b < 0) /\ (undef12 = 1), par{main_x -> (main_x - 1), main_y -> (main_y - 1), main_b -> 0, varCall_6 -> undef12}>
0.00/0.23	<l2, l2, (main_x >= 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b > 0) /\ (undef12 = 0), par{main_y -> (main_y - 1), varCall_6 -> undef12}>
0.00/0.23	<l2, l2, (main_x >= 0) /\ (0 <= main_y) /\ (main_y <= main_n) /\ (main_b > 0) /\ (undef12 = 1), par{main_x -> (main_x - 1), main_y -> (main_y - 1), main_b -> 0, varCall_6 -> undef12}>
0.00/0.23	<l2, l18, (main_x >= 0) /\ (0 <= main_y) /\ not((main_y <= main_n))>
0.00/0.23	<l2, l18, (main_x >= 0) /\ not((0 <= main_y))>
0.00/0.23	<l2, l18, not((main_x >= 0))>
0.00/0.23	
0.00/0.23	Fresh variables:
0.00/0.23	undef7, undef8, undef9, undef10, undef11, undef12, 
0.00/0.23	
0.00/0.23	Undef variables:
0.00/0.23	undef7, undef8, undef9, undef10, undef11, undef12, 
0.00/0.23	
0.00/0.23	Abstraction variables:
0.00/0.23	
0.00/0.23	Exit nodes:
0.00/0.23	18, 
0.00/0.23	Accepting locations:
0.00/0.23	
0.00/0.23	Asserts:
0.00/0.23	
0.00/0.23	*************************************************************
0.00/0.23	*******************************************************************************************
0.00/0.23	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.23	*******************************************************************************************
0.00/0.23	
0.00/0.23	Init Location: 0
0.00/0.23	Graph 0:
0.00/0.23	Transitions:
0.00/0.23	Variables:
0.00/0.23	
0.00/0.23	Graph 1:
0.00/0.23	Transitions:
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ main_b = 0 /\ undef11 = 0, {main_y -> 1 + main_y, varCall_5 -> undef11, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ main_b = 0 /\ undef11 = 1, {main_y -> 1 + main_y, main_b -> 1, varCall_5 -> undef11, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ 1 + main_b <= 0 /\ undef12 = 0, {main_y -> -1 + main_y, varCall_6 -> undef12, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ 1 + main_b <= 0 /\ undef12 = 1, {main_x -> -1 + main_x, main_y -> -1 + main_y, main_b -> 0, varCall_6 -> undef12, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ 1 <= main_b /\ undef12 = 0, {main_y -> -1 + main_y, varCall_6 -> undef12, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ 1 <= main_b /\ undef12 = 1, {main_x -> -1 + main_x, main_y -> -1 + main_y, main_b -> 0, varCall_6 -> undef12, rest remain the same}>
0.00/0.23	Variables:
0.00/0.23	main_x, main_y, main_n, main_b, varCall_5, varCall_6
0.00/0.23	
0.00/0.23	Graph 2:
0.00/0.23	Transitions:
0.00/0.23	Variables:
0.00/0.23	
0.00/0.23	Precedence: 
0.00/0.23	Graph 0
0.00/0.23	
0.00/0.23	Graph 1
0.00/0.23	<l0, l2, main_x = undef9 /\ main_y = undef10 /\ main_n = undef7 /\ main_b = undef8, {all remain the same}>
0.00/0.23	
0.00/0.23	Graph 2
0.00/0.23	<l2, l18, 0 <= main_x /\ 0 <= main_y /\ 1 + main_n <= main_y, {all remain the same}>
0.00/0.23	<l2, l18, 0 <= main_x /\ 1 + main_y <= 0, {all remain the same}>
0.00/0.23	<l2, l18, 1 + main_x <= 0, {all remain the same}>
0.00/0.23	
0.00/0.23	Map Locations to Subgraph:
0.00/0.23	( 0 , 0 )
0.00/0.23	( 2 , 1 )
0.00/0.23	( 18 , 2 )
0.00/0.23	
0.00/0.23	*******************************************************************************************
0.00/0.23	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.23	*******************************************************************************************
0.00/0.23	
0.00/0.23	Proving termination of subgraph 0
0.00/0.23	Proving termination of subgraph 1
0.00/0.23	Checking unfeasibility...
0.00/0.23	Time used: 0.032382
0.00/0.23	
0.00/0.23	Checking conditional termination of SCC {l2}...
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.008087s
0.00/0.23	Ranking function: main_x
0.00/0.23	New Graphs: 
0.00/0.23	Transitions:
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ main_b = 0 /\ undef11 = 0, {main_y -> 1 + main_y, varCall_5 -> undef11, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ main_b = 0 /\ undef11 = 1, {main_y -> 1 + main_y, main_b -> 1, varCall_5 -> undef11, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ 1 + main_b <= 0 /\ undef12 = 0, {main_y -> -1 + main_y, varCall_6 -> undef12, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ 1 <= main_b /\ undef12 = 0, {main_y -> -1 + main_y, varCall_6 -> undef12, rest remain the same}>
0.00/0.23	Variables:
0.00/0.23	main_x, main_y, main_n, main_b, varCall_5, varCall_6
0.00/0.23	Checking conditional termination of SCC {l2}...
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.003602s
0.00/0.23	Ranking function: -2*main_b
0.00/0.23	New Graphs: 
0.00/0.23	Transitions:
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ main_b = 0 /\ undef11 = 0, {main_y -> 1 + main_y, varCall_5 -> undef11, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ 1 + main_b <= 0 /\ undef12 = 0, {main_y -> -1 + main_y, varCall_6 -> undef12, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ 1 <= main_b /\ undef12 = 0, {main_y -> -1 + main_y, varCall_6 -> undef12, rest remain the same}>
0.00/0.23	Variables:
0.00/0.23	main_x, main_y, main_n, main_b, varCall_5, varCall_6
0.00/0.23	Checking conditional termination of SCC {l2}...
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.002403s
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.013261s
0.00/0.23	[37276 : 37279]
0.00/0.23	[37276 : 37280]
0.00/0.23	Successful child: 37280
0.00/0.23	Ranking function: main_y
0.00/0.23	Ranking function and negation of Quasi-Invariant applied
0.00/0.23	New Graphs: 
0.00/0.23	Transitions:
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ main_b = 0 /\ undef11 = 0, {main_y -> 1 + main_y, varCall_5 -> undef11, rest remain the same}>
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ 1 + main_b <= 0 /\ undef12 = 0, {main_y -> -1 + main_y, varCall_6 -> undef12, rest remain the same}>
0.00/0.23	Variables:
0.00/0.23	main_x, main_y, main_n, main_b, varCall_5, varCall_6
0.00/0.23	Checking conditional termination of SCC {l2}...
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.002074s
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.010005s
0.00/0.23	[37276 : 37286]
0.00/0.23	[37276 : 37287]
0.00/0.23	Successful child: 37287
0.00/0.23	Ranking function: main_y
0.00/0.23	Ranking function and negation of Quasi-Invariant applied
0.00/0.23	New Graphs: 
0.00/0.23	Transitions:
0.00/0.23	<l2, l2, 0 <= main_x /\ main_y <= main_n /\ 0 <= main_y /\ main_b = 0 /\ undef11 = 0, {main_y -> 1 + main_y, varCall_5 -> undef11, rest remain the same}>
0.00/0.23	Variables:
0.00/0.23	main_x, main_y, main_n, main_b, varCall_5
0.00/0.23	Checking conditional termination of SCC {l2}...
0.00/0.23	
0.00/0.23	LOG: CALL solveLinear
0.00/0.23	
0.00/0.23	LOG: RETURN solveLinear - Elapsed time: 0.001964s
0.00/0.23	Ranking function: -main_y + main_n
0.00/0.23	New Graphs: 
0.00/0.23	Proving termination of subgraph 2
0.00/0.23	Analyzing SCC {l18}...
0.00/0.23	No cycles found.
0.00/0.23	
0.00/0.23	Program Terminates
0.00/0.23	EOF