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