0.00/0.05	YES
0.00/0.05	
0.00/0.05	Solver Timeout: 4
0.00/0.05	Global Timeout: 300
0.00/0.05	Maximum number of concurrent processes: 900
0.00/0.05	*******************************************************************************************
0.00/0.05	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.05	*******************************************************************************************
0.00/0.05	
0.00/0.05	
0.00/0.05	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.05	
0.00/0.05	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.05	+                                                                  +
0.00/0.05	Init Location: 0
0.00/0.05	Transitions:
0.00/0.05	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.05	<l1, l2, (main_x < 0)>
0.00/0.05	<l1, l4, not((main_x < 0))>
0.00/0.05	<l2, l3, true, seq{main_x -> ~(main_x)}>
0.00/0.05	<l3, l4, true>
0.00/0.05	<l4, l5, (main_y < 0)>
0.00/0.05	<l4, l7, not((main_y < 0))>
0.00/0.05	<l5, l6, true, seq{main_y -> ~(main_y)}>
0.00/0.05	<l6, l7, true>
0.00/0.05	<l7, l8, true>
0.00/0.05	<l8, l16, not((main_y > 0))>
0.00/0.05	<l8, l9, (main_y > 0)>
0.00/0.05	<l9, l10, true, seq{main_r -> main_x}>
0.00/0.05	<l10, l11, true>
0.00/0.05	<l11, l14, not((main_r >= main_y))>
0.00/0.05	<l11, l12, (main_r >= main_y)>
0.00/0.05	<l12, l13, true, seq{main_r -> (main_r - main_y)}>
0.00/0.05	<l13, l11, true>
0.00/0.05	<l14, l15, true, seq{main_x -> main_y, main_y -> main_r}>
0.00/0.05	<l15, l8, true>
0.00/0.05	<l16, l17, true, seq{main__func_return_ -> 0}>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	
0.00/0.05	Abstraction variables:
0.00/0.05	
0.00/0.05	Exit nodes:
0.00/0.05	
0.00/0.05	Accepting locations:
0.00/0.05	
0.00/0.05	Asserts:
0.00/0.05	
0.00/0.05	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.05	       
0.00/0.05	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.05	       
0.00/0.05	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.05	
0.00/0.05	Init Location: 0
0.00/0.05	Transitions:
0.00/0.05	<l0, l18, true, seq{main__func_return_ -> 0}>
0.00/0.05	<l18, l19, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.05	<l19, l20, true, seq{main_x -> varCall_1}>
0.00/0.05	<l20, l21, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.05	<l21, l1, true, seq{main_y -> varCall_2}>
0.00/0.05	<l1, l2, (main_x < 0)>
0.00/0.05	<l1, l4, not((main_x < 0))>
0.00/0.05	<l2, l3, true, seq{main_x -> ~(main_x)}>
0.00/0.05	<l3, l4, true>
0.00/0.05	<l4, l5, (main_y < 0)>
0.00/0.05	<l4, l7, not((main_y < 0))>
0.00/0.05	<l5, l6, true, seq{main_y -> ~(main_y)}>
0.00/0.05	<l6, l7, true>
0.00/0.05	<l7, l8, true>
0.00/0.05	<l8, l9, (main_y > 0)>
0.00/0.05	<l8, l16, not((main_y > 0))>
0.00/0.05	<l9, l10, true, seq{main_r -> main_x}>
0.00/0.05	<l10, l11, true>
0.00/0.05	<l11, l12, (main_r >= main_y)>
0.00/0.05	<l11, l14, not((main_r >= main_y))>
0.00/0.05	<l12, l13, true, seq{main_r -> (main_r - main_y)}>
0.00/0.05	<l13, l11, true>
0.00/0.05	<l14, l15, true, seq{main_x -> main_y, main_y -> main_r}>
0.00/0.05	<l15, l8, true>
0.00/0.05	<l16, l17, true, seq{main__func_return_ -> 0}>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	
0.00/0.05	Abstraction variables:
0.00/0.05	
0.00/0.05	Exit nodes:
0.00/0.05	17, 
0.00/0.05	Accepting locations:
0.00/0.05	
0.00/0.05	Asserts:
0.00/0.05	
0.00/0.05	+                                                                  +
0.00/0.05	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.05	
0.00/0.05	
0.00/0.05	Function Return and Parameters Information [2 functions]:
0.00/0.05	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.05	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.05	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.05	        main__func_return_      [function result] : int
0.00/0.05	
0.00/0.05	
0.00/0.05	AST Ident Scanner Information [5 idents]:
0.00/0.05	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 17, col: 6> <line: 18, col: 6>
0.00/0.05	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.05	r | local variable | integer | <line: 15, col: 2> | <line: 24, col: 3> <line: 25, col: 10> <line: 26, col: 4> <line: 26, col: 8> <line: 30, col: 7>
0.00/0.05	x | local variable | integer | <line: 15, col: 2> | <line: 17, col: 2> <line: 20, col: 6> <line: 20, col: 12> <line: 20, col: 17> <line: 24, col: 7> <line: 29, col: 3>
0.00/0.05	y | local variable | integer | <line: 15, col: 2> | <line: 18, col: 2> <line: 21, col: 6> <line: 21, col: 12> <line: 21, col: 17> <line: 22, col: 9> <line: 25, col: 13> <line: 26, col: 10> <line: 29, col: 7> <line: 30, col: 3>
0.00/0.05	
0.00/0.05	Main function: main
0.00/0.05	Preprocessed LLVMGraph
0.00/0.05	Init Location: 0
0.00/0.05	Transitions:
0.00/0.05	<l0, l11, (undef3 < 0) /\ (undef4 < 0) /\ (~(undef4) > 0), par{main_r -> ~(undef3), main_y -> ~(undef4)}>
0.00/0.05	<l0, l11, (undef3 < 0) /\ not((undef4 < 0)) /\ (undef4 > 0), par{main_r -> ~(undef3), main_y -> undef4}>
0.00/0.05	<l0, l17, (undef3 < 0) /\ not((undef4 < 0)) /\ not((undef4 > 0)), par{main_y -> undef4}>
0.00/0.05	<l0, l11, not((undef3 < 0)) /\ (undef4 < 0) /\ (~(undef4) > 0), par{main_r -> undef3, main_y -> ~(undef4)}>
0.00/0.05	<l0, l11, not((undef3 < 0)) /\ not((undef4 < 0)) /\ (undef4 > 0), par{main_r -> undef3, main_y -> undef4}>
0.00/0.05	<l0, l17, not((undef3 < 0)) /\ not((undef4 < 0)) /\ not((undef4 > 0)), par{main_y -> undef4}>
0.00/0.05	<l11, l11, (main_r >= main_y), par{main_r -> (main_r - main_y)}>
0.00/0.05	<l11, l11, not((main_r >= main_y)) /\ (main_r > 0), par{main_r -> main_y, main_y -> main_r}>
0.00/0.05	<l11, l17, not((main_r >= main_y)) /\ not((main_r > 0)), par{main_y -> main_r}>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef3, undef4, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef3, undef4, 
0.00/0.05	
0.00/0.05	Abstraction variables:
0.00/0.05	
0.00/0.05	Exit nodes:
0.00/0.05	17, 
0.00/0.05	Accepting locations:
0.00/0.05	
0.00/0.05	Asserts:
0.00/0.05	
0.00/0.05	*************************************************************
0.00/0.05	*******************************************************************************************
0.00/0.05	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.05	*******************************************************************************************
0.00/0.05	
0.00/0.05	Init Location: 0
0.00/0.05	Graph 0:
0.00/0.05	Transitions:
0.00/0.05	Variables:
0.00/0.05	
0.00/0.05	Graph 1:
0.00/0.05	Transitions:
0.00/0.05	<l11, l11, main_y <= main_r, {main_r -> main_r - main_y, rest remain the same}>
0.00/0.05	<l11, l11, 1 + main_r <= main_y /\ 1 <= main_r, {main_r -> main_y, main_y -> main_r, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	main_r, main_y
0.00/0.05	
0.00/0.05	Graph 2:
0.00/0.05	Transitions:
0.00/0.05	Variables:
0.00/0.05	
0.00/0.05	Precedence: 
0.00/0.05	Graph 0
0.00/0.05	
0.00/0.05	Graph 1
0.00/0.05	<l0, l11, 1 + undef3 <= 0 /\ 1 + undef4 <= 0, {main_r -> -undef3, main_y -> -undef4, rest remain the same}>
0.00/0.05	<l0, l11, 1 + undef3 <= 0 /\ 1 <= undef4, {main_r -> -undef3, main_y -> undef4, rest remain the same}>
0.00/0.05	<l0, l11, 0 <= undef3 /\ 1 + undef4 <= 0, {main_r -> undef3, main_y -> -undef4, rest remain the same}>
0.00/0.05	<l0, l11, 0 <= undef3 /\ 1 <= undef4, {main_r -> undef3, main_y -> undef4, rest remain the same}>
0.00/0.05	
0.00/0.05	Graph 2
0.00/0.05	<l0, l17, 1 + undef3 <= 0 /\ undef4 = 0, {main_y -> undef4, rest remain the same}>
0.00/0.05	<l0, l17, 0 <= undef3 /\ undef4 = 0, {main_y -> undef4, rest remain the same}>
0.00/0.05	<l11, l17, main_r <= 0 /\ 1 + main_r <= main_y, {main_y -> main_r, rest remain the same}>
0.00/0.05	
0.00/0.05	Map Locations to Subgraph:
0.00/0.05	( 0 , 0 )
0.00/0.05	( 11 , 1 )
0.00/0.05	( 17 , 2 )
0.00/0.05	
0.00/0.05	*******************************************************************************************
0.00/0.05	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.05	*******************************************************************************************
0.00/0.05	
0.00/0.05	Proving termination of subgraph 0
0.00/0.05	Proving termination of subgraph 1
0.00/0.05	Checking unfeasibility...
0.00/0.05	Time used: 0.004457
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l11}...
0.00/0.05	
0.00/0.05	LOG: CALL solveLinear
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear - Elapsed time: 0.001251s
0.00/0.05	Ranking function: -1 + main_y
0.00/0.05	New Graphs: 
0.00/0.05	Transitions:
0.00/0.05	<l11, l11, main_y <= main_r, {main_r -> main_r - main_y, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	main_r, main_y
0.00/0.05	Checking conditional termination of SCC {l11}...
0.00/0.05	
0.00/0.05	LOG: CALL solveLinear
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear - Elapsed time: 0.000535s
0.00/0.05	
0.00/0.05	LOG: CALL solveLinear
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear - Elapsed time: 0.001459s
0.00/0.05	[1337 : 1339]
0.00/0.05	[1337 : 1340]
0.00/0.05	Successful child: 1339
0.00/0.05	[ Invariant Graph ]
0.00/0.05	Strengthening and disabling transitions...
0.00/0.05	
0.00/0.05	LOG: CALL solverLinear in Graph for feasibility
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.05	Strengthening transition (result): 
0.00/0.05	<l11, l11, main_y <= main_r /\ 1 <= main_y, {main_r -> main_r - main_y, rest remain the same}>
0.00/0.05	
0.00/0.05	LOG: CALL solverLinear in Graph for feasibility
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.05	Strengthening transition (result): 
0.00/0.05	<l11, l11, 1 + main_r <= main_y /\ 1 <= main_r /\ 1 <= main_y, {main_r -> main_y, main_y -> main_r, rest remain the same}>
0.00/0.05	[ Termination Graph ]
0.00/0.05	Strengthening and disabling transitions...
0.00/0.05	
0.00/0.05	LOG: CALL solverLinear in Graph for feasibility
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.05	Strengthening transition (result): 
0.00/0.05	<l11, l11, main_y <= main_r /\ 1 <= main_y, {main_r -> main_r - main_y, rest remain the same}>
0.00/0.05	Ranking function: main_r - main_y
0.00/0.05	New Graphs: 
0.00/0.05	INVARIANTS: 
0.00/0.05	11: 1 <= main_y , 
0.00/0.05	Quasi-INVARIANTS to narrow Graph: 
0.00/0.05	11: 
0.00/0.05	Proving termination of subgraph 2
0.00/0.05	Analyzing SCC {l17}...
0.00/0.05	No cycles found.
0.00/0.05	
0.00/0.05	Program Terminates
0.00/0.05	EOF