0.00/0.03	YES
0.00/0.03	
0.00/0.03	Solver Timeout: 4
0.00/0.03	Global Timeout: 300
0.00/0.03	Maximum number of concurrent processes: 900
0.00/0.03	*******************************************************************************************
0.00/0.03	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	
0.00/0.03	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.03	
0.00/0.03	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.03	+                                                                  +
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<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.03	<l1, l2, (main_x < main_y)>
0.00/0.03	<l1, l4, not((main_x < main_y))>
0.00/0.03	<l2, l3, true, seq{main_min -> main_x}>
0.00/0.03	<l3, l6, true>
0.00/0.03	<l4, l5, true, seq{main_min -> main_y}>
0.00/0.03	<l5, l6, true>
0.00/0.03	<l6, l7, true>
0.00/0.03	<l7, l15, not((main_min = main_y))>
0.00/0.03	<l7, l8, (main_min = main_y)>
0.00/0.03	<l8, l9, true, seq{main_y -> (main_y + 1), main_res -> (main_res + 1)}>
0.00/0.03	<l9, l10, (main_x < main_y)>
0.00/0.03	<l9, l12, not((main_x < main_y))>
0.00/0.03	<l10, l11, true, seq{main_min -> main_x}>
0.00/0.03	<l11, l14, true>
0.00/0.03	<l12, l13, true, seq{main_min -> main_y}>
0.00/0.03	<l13, l14, true>
0.00/0.03	<l14, l7, true>
0.00/0.03	<l15, l16, true, seq{main__func_return_ -> 0}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.03	       
0.00/0.03	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.03	       
0.00/0.03	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l17, true, seq{main__func_return_ -> 0}>
0.00/0.03	<l17, l18, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.03	<l18, l19, true, seq{main_x -> varCall_1}>
0.00/0.03	<l19, l20, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.03	<l20, l1, true, seq{main_y -> varCall_2, main_res -> 0}>
0.00/0.03	<l1, l2, (main_x < main_y)>
0.00/0.03	<l1, l4, not((main_x < main_y))>
0.00/0.03	<l2, l3, true, seq{main_min -> main_x}>
0.00/0.03	<l3, l6, true>
0.00/0.03	<l4, l5, true, seq{main_min -> main_y}>
0.00/0.03	<l5, l6, true>
0.00/0.03	<l6, l7, true>
0.00/0.03	<l7, l8, (main_min = main_y)>
0.00/0.03	<l7, l15, not((main_min = main_y))>
0.00/0.03	<l8, l9, true, seq{main_y -> (main_y + 1), main_res -> (main_res + 1)}>
0.00/0.03	<l9, l10, (main_x < main_y)>
0.00/0.03	<l9, l12, not((main_x < main_y))>
0.00/0.03	<l10, l11, true, seq{main_min -> main_x}>
0.00/0.03	<l11, l14, true>
0.00/0.03	<l12, l13, true, seq{main_min -> main_y}>
0.00/0.03	<l13, l14, true>
0.00/0.03	<l14, l7, true>
0.00/0.03	<l15, l16, true, seq{main__func_return_ -> 0}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	16, 
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	+                                                                  +
0.00/0.03	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.03	
0.00/0.03	
0.00/0.03	Function Return and Parameters Information [2 functions]:
0.00/0.03	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.03	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.03	    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 [6 idents]:
0.00/0.04	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 10, col: 9> <line: 11, col: 9>
0.00/0.04	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.04	x | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 14, col: 9> <line: 14, col: 24> <line: 20, col: 13> <line: 20, col: 28>
0.00/0.04	y | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 14, col: 13> <line: 15, col: 18> <line: 17, col: 19> <line: 18, col: 9> <line: 18, col: 13> <line: 20, col: 17> <line: 21, col: 22>
0.00/0.04	res | local variable | integer | <line: 8, col: 5> | <line: 12, col: 5> <line: 19, col: 9> <line: 19, col: 15>
0.00/0.04	min | local variable | integer | <line: 9, col: 5> | <line: 14, col: 18> <line: 15, col: 12> <line: 17, col: 12> <line: 20, col: 22> <line: 21, col: 16>
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, l7, (main_x = undef3) /\ (main_y = undef4) /\ (main_res = 0) /\ (undef3 < undef4), par{main_min -> undef3}>
0.00/0.04	<l0, l7, (main_x = undef3) /\ (main_y = undef4) /\ (main_res = 0) /\ not((undef3 < undef4)), par{main_min -> undef4}>
0.00/0.04	<l7, l7, (main_min = main_y) /\ (main_x < (main_y + 1)), par{main_y -> (main_y + 1), main_res -> (main_res + 1), main_min -> main_x}>
0.00/0.04	<l7, l7, (main_min = main_y) /\ not((main_x < (main_y + 1))), par{main_y -> (main_y + 1), main_res -> (main_res + 1), main_min -> (main_y + 1)}>
0.00/0.04	<l7, l16, (main_min < main_y)>
0.00/0.04	<l7, l16, (main_min > main_y)>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef3, undef4, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef3, undef4, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	16, 
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	<l7, l7, main_x <= main_y /\ main_y = main_min, {main_y -> 1 + main_y, main_res -> 1 + main_res, main_min -> main_x, rest remain the same}>
0.00/0.04	<l7, l7, 1 + main_y <= main_x /\ main_y = main_min, {main_y -> 1 + main_y, main_res -> 1 + main_res, main_min -> 1 + main_y, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_x, main_y, main_res, main_min
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, l7, 1 + undef3 <= undef4 /\ main_x = undef3 /\ main_y = undef4 /\ main_res = 0, {main_min -> undef3, rest remain the same}>
0.00/0.04	<l0, l7, undef4 <= undef3 /\ main_x = undef3 /\ main_y = undef4 /\ main_res = 0, {main_min -> undef4, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l7, l16, 1 + main_min <= main_y, {all remain the same}>
0.00/0.04	<l7, l16, 1 + main_y <= main_min, {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	( 7 , 1 )
0.00/0.04	( 16 , 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.006095
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l7}...
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.001514s
0.00/0.04	Ranking function: -1 + 3*main_x - 3*main_y
0.00/0.04	New Graphs: 
0.00/0.04	Transitions:
0.00/0.04	<l7, l7, main_x <= main_y /\ main_y = main_min, {main_y -> 1 + main_y, main_res -> 1 + main_res, main_min -> main_x, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_x, main_y, main_res, main_min
0.00/0.04	Checking conditional termination of SCC {l7}...
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.000732s
0.00/0.04	Ranking function: -main_y + main_min
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Analyzing SCC {l16}...
0.00/0.04	No cycles found.
0.00/0.04	
0.00/0.04	Program Terminates
0.00/0.04	EOF