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), main_res -> 0}>
0.00/0.05	<l1, l2, true>
0.00/0.05	<l2, l15, not((main_x >= main_y))>
0.00/0.05	<l2, l3, (main_x >= main_y)>
0.00/0.05	<l3, l15, not((main_y > 0))>
0.00/0.05	<l3, l4, (main_y > 0)>
0.00/0.05	<l4, l5, true, seq{main_ytmp -> main_y}>
0.00/0.05	<l5, l6, true>
0.00/0.05	<l6, l13, (main_ytmp = 0)>
0.00/0.05	<l6, l7, not((main_ytmp = 0))>
0.00/0.05	<l7, l8, (main_ytmp > 0)>
0.00/0.05	<l7, l10, not((main_ytmp > 0))>
0.00/0.05	<l8, l9, true, seq{main_ytmp -> (main_ytmp - 1), main_x -> (main_x - 1)}>
0.00/0.05	<l9, l12, true>
0.00/0.05	<l10, l11, true, seq{main_ytmp -> (main_ytmp + 1), main_x -> (main_x + 1)}>
0.00/0.05	<l11, l12, true>
0.00/0.05	<l12, l6, true>
0.00/0.05	<l13, l14, true, seq{main_res -> (main_res + 1)}>
0.00/0.05	<l14, l2, true>
0.00/0.05	<l15, l16, 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, l17, true, seq{main__func_return_ -> 0}>
0.00/0.05	<l17, l18, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.05	<l18, l19, true, seq{main_x -> varCall_1}>
0.00/0.05	<l19, l20, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.05	<l20, l1, true, seq{main_y -> varCall_2, main_res -> 0}>
0.00/0.05	<l1, l2, true>
0.00/0.05	<l2, l3, (main_x >= main_y)>
0.00/0.06	<l2, l15, not((main_x >= main_y))>
0.00/0.06	<l3, l4, (main_y > 0)>
0.00/0.06	<l3, l15, not((main_y > 0))>
0.00/0.06	<l4, l5, true, seq{main_ytmp -> main_y}>
0.00/0.06	<l5, l6, true>
0.00/0.06	<l6, l13, (main_ytmp = 0)>
0.00/0.06	<l6, l7, not((main_ytmp = 0))>
0.00/0.06	<l7, l8, (main_ytmp > 0)>
0.00/0.06	<l7, l10, not((main_ytmp > 0))>
0.00/0.06	<l8, l9, true, seq{main_ytmp -> (main_ytmp - 1), main_x -> (main_x - 1)}>
0.00/0.06	<l9, l12, true>
0.00/0.06	<l10, l11, true, seq{main_ytmp -> (main_ytmp + 1), main_x -> (main_x + 1)}>
0.00/0.06	<l11, l12, true>
0.00/0.06	<l12, l6, true>
0.00/0.06	<l13, l14, true, seq{main_res -> (main_res + 1)}>
0.00/0.06	<l14, l2, true>
0.00/0.06	<l15, l16, 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	16, 
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 [6 idents]:
0.00/0.06	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 10, col: 9> <line: 11, col: 9>
0.00/0.06	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.06	x | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 14, col: 12> <line: 19, col: 17> <line: 19, col: 21> <line: 22, col: 17> <line: 22, col: 21>
0.00/0.06	y | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 14, col: 17> <line: 14, col: 22> <line: 15, col: 16>
0.00/0.06	ytmp | local variable | integer | <line: 8, col: 5> | <line: 15, col: 9> <line: 16, col: 16> <line: 17, col: 17> <line: 18, col: 17> <line: 18, col: 24> <line: 21, col: 17> <line: 21, col: 24>
0.00/0.06	res | local variable | integer | <line: 9, col: 5> | <line: 12, col: 5> <line: 25, col: 9> <line: 25, col: 15>
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, l6, (main_x = undef3) /\ (main_y = undef4) /\ (main_res = 0) /\ (undef3 >= undef4) /\ (undef4 > 0), par{main_ytmp -> undef4}>
0.00/0.06	<l0, l16, (main_x = undef3) /\ (main_y = undef4) /\ (main_res = 0) /\ (undef3 >= undef4) /\ not((undef4 > 0))>
0.00/0.06	<l0, l16, (main_x = undef3) /\ (main_y = undef4) /\ (main_res = 0) /\ not((undef3 >= undef4))>
0.00/0.06	<l6, l6, (main_ytmp = 0) /\ (main_x >= main_y) /\ (main_y > 0), par{main_ytmp -> main_y, main_res -> (main_res + 1)}>
0.00/0.06	<l6, l16, (main_ytmp = 0) /\ (main_x >= main_y) /\ not((main_y > 0)), par{main_res -> (main_res + 1)}>
0.00/0.06	<l6, l16, (main_ytmp = 0) /\ not((main_x >= main_y)), par{main_res -> (main_res + 1)}>
0.00/0.06	<l6, l6, (main_ytmp < 0) /\ not((main_ytmp > 0)), par{main_x -> (main_x + 1), main_ytmp -> (main_ytmp + 1)}>
0.00/0.06	<l6, l6, (main_ytmp > 0) /\ (main_ytmp > 0), par{main_x -> (main_x - 1), main_ytmp -> (main_ytmp - 1)}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef3, undef4, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef3, undef4, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	16, 
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	<l6, l6, main_y <= main_x /\ 1 <= main_y /\ main_ytmp = 0, {main_ytmp -> main_y, main_res -> 1 + main_res, rest remain the same}>
0.00/0.06	<l6, l6, 1 + main_ytmp <= 0, {main_x -> 1 + main_x, main_ytmp -> 1 + main_ytmp, rest remain the same}>
0.00/0.06	<l6, l6, 1 <= main_ytmp, {main_x -> -1 + main_x, main_ytmp -> -1 + main_ytmp, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_x, main_y, main_ytmp, main_res
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, l6, undef4 <= undef3 /\ 1 <= undef4 /\ main_x = undef3 /\ main_y = undef4 /\ main_res = 0, {main_ytmp -> undef4, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l0, l16, undef4 <= undef3 /\ undef4 <= 0 /\ main_x = undef3 /\ main_y = undef4 /\ main_res = 0, {all remain the same}>
0.00/0.06	<l0, l16, 1 + undef3 <= undef4 /\ main_x = undef3 /\ main_y = undef4 /\ main_res = 0, {all remain the same}>
0.00/0.06	<l6, l16, main_y <= main_x /\ main_y <= 0 /\ main_ytmp = 0, {main_res -> 1 + main_res, rest remain the same}>
0.00/0.06	<l6, l16, 1 + main_x <= main_y /\ main_ytmp = 0, {main_res -> 1 + main_res, rest 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	( 6 , 1 )
0.00/0.06	( 16 , 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.013377
0.00/0.06	Some transition disabled by a set of invariant(s):
0.00/0.06	Invariant at l6: 0 <= main_ytmp
0.00/0.06	
0.00/0.06	Strengthening and disabling transitions...
0.00/0.06	> It's unfeasible. Removing transition: 
0.00/0.06	<l6, l6, 1 + main_ytmp <= 0, {main_x -> 1 + main_x, main_ytmp -> 1 + main_ytmp, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l6, l6, main_y <= main_x /\ 1 <= main_y /\ main_ytmp = 0, {main_ytmp -> main_y, main_res -> 1 + main_res, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l6, l6, 1 <= main_ytmp, {main_x -> -1 + main_x, main_ytmp -> -1 + main_ytmp, rest remain the same}>
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.007961
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l6}...
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.001510s
0.00/0.06	Ranking function: 2*main_x - 2*main_y - 2*main_ytmp
0.00/0.06	New Graphs: 
0.00/0.06	Transitions:
0.00/0.06	<l6, l6, 1 <= main_ytmp, {main_x -> -1 + main_x, main_ytmp -> -1 + main_ytmp, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_x, main_ytmp
0.00/0.06	Checking conditional termination of SCC {l6}...
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.000546s
0.00/0.06	Ranking function: -1 + main_ytmp
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Analyzing SCC {l16}...
0.00/0.06	No cycles found.
0.00/0.06	
0.00/0.06	Program Terminates
0.00/0.06	EOF