0.00/0.04	YES
0.00/0.04	
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_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.05	<l1, l2, (main_a = main_b)>
0.00/0.05	<l1, l7, not((main_a = main_b))>
0.00/0.05	<l2, l3, true>
0.00/0.05	<l3, l6, not((main_x >= 0))>
0.00/0.05	<l3, l4, (main_x >= 0)>
0.00/0.05	<l4, l5, true, seq{main_x -> (((main_x + main_a) - main_b) - 1)}>
0.00/0.05	<l5, l3, true>
0.00/0.05	<l6, l7, true>
0.00/0.05	<l7, l8, 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, l9, true, seq{main__func_return_ -> 0}>
0.00/0.05	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.05	<l10, l11, true, seq{main_x -> varCall_1}>
0.00/0.05	<l11, l12, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.05	<l12, l13, true, seq{main_a -> varCall_2}>
0.00/0.05	<l13, l14, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.05	<l14, l1, true, seq{main_b -> varCall_3}>
0.00/0.05	<l1, l2, (main_a = main_b)>
0.00/0.05	<l1, l7, not((main_a = main_b))>
0.00/0.05	<l2, l3, true>
0.00/0.05	<l3, l4, (main_x >= 0)>
0.00/0.05	<l3, l6, not((main_x >= 0))>
0.00/0.05	<l4, l5, true, seq{main_x -> (((main_x + main_a) - main_b) - 1)}>
0.00/0.05	<l5, l3, true>
0.00/0.05	<l6, l7, true>
0.00/0.05	<l7, l8, 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	8, 
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: 18, col: 9> <line: 19, col: 9> <line: 20, col: 9>
0.00/0.05	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.05	x | local variable | integer | <line: 15, col: 5> | <line: 18, col: 5> <line: 22, col: 16> <line: 23, col: 13> <line: 23, col: 17>
0.00/0.05	a | local variable | integer | <line: 16, col: 5> | <line: 19, col: 5> <line: 21, col: 9> <line: 23, col: 21>
0.00/0.05	b | local variable | integer | <line: 17, col: 5> | <line: 20, col: 5> <line: 21, col: 14> <line: 23, col: 25>
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, l3, (main_x = undef4) /\ (main_a = undef5) /\ (main_b = undef6) /\ (undef5 = undef6)>
0.00/0.05	<l0, l8, (main_x = undef4) /\ (main_a = undef5) /\ (main_b = undef6) /\ (undef5 < undef6)>
0.00/0.05	<l0, l8, (main_x = undef4) /\ (main_a = undef5) /\ (main_b = undef6) /\ (undef5 > undef6)>
0.00/0.05	<l3, l3, (main_x >= 0), par{main_x -> (((main_x + main_a) - main_b) - 1)}>
0.00/0.05	<l3, l8, not((main_x >= 0))>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef4, undef5, undef6, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef4, undef5, undef6, 
0.00/0.05	
0.00/0.05	Abstraction variables:
0.00/0.05	
0.00/0.05	Exit nodes:
0.00/0.05	8, 
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	<l3, l3, 0 <= main_x, {main_x -> -1 + main_x + main_a - main_b, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	main_x, main_a, main_b
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, l3, main_x = undef4 /\ main_a = undef5 /\ main_b = undef6 /\ undef5 = undef6, {all remain the same}>
0.00/0.05	
0.00/0.05	Graph 2
0.00/0.05	<l0, l8, 1 + undef5 <= undef6 /\ main_x = undef4 /\ main_a = undef5 /\ main_b = undef6, {all remain the same}>
0.00/0.05	<l0, l8, 1 + undef6 <= undef5 /\ main_x = undef4 /\ main_a = undef5 /\ main_b = undef6, {all remain the same}>
0.00/0.05	<l3, l8, 1 + main_x <= 0, {all 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	( 3 , 1 )
0.00/0.05	( 8 , 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.002297
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l3}...
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.001028s
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.001783s
0.00/0.05	[39637 : 39639]
0.00/0.05	[39637 : 39640]
0.00/0.05	Successful child: 39639
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	<l3, l3, 0 <= main_x /\ main_a <= main_b, {main_x -> -1 + main_x + main_a - main_b, 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	<l3, l3, 0 <= main_x /\ main_a <= main_b, {main_x -> -1 + main_x + main_a - main_b, rest remain the same}>
0.00/0.05	Ranking function: main_x
0.00/0.05	New Graphs: 
0.00/0.05	INVARIANTS: 
0.00/0.05	3: main_a <= main_b , 
0.00/0.05	Quasi-INVARIANTS to narrow Graph: 
0.00/0.05	3: 
0.00/0.05	Proving termination of subgraph 2
0.00/0.05	Analyzing SCC {l8}...
0.00/0.05	No cycles found.
0.00/0.05	
0.00/0.05	Program Terminates
0.00/0.05	EOF