0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	Maximum number of concurrent processes: 900
0.00/0.06	*******************************************************************************************
0.00/0.06	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	
0.00/0.06	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.06	
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	+                                                                  +
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<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.06	<l1, l13, not((main_x > 0))>
0.00/0.06	<l1, l2, (main_x > 0)>
0.00/0.06	<l2, l3, (main_y > 0)>
0.00/0.06	<l2, l13, not((main_y > 0))>
0.00/0.06	<l3, l4, true>
0.00/0.06	<l4, l12, (main_x = 0)>
0.00/0.06	<l4, l5, not((main_x = 0))>
0.00/0.06	<l5, l6, (main_x > main_y)>
0.00/0.06	<l5, l8, not((main_x > main_y))>
0.00/0.06	<l6, l7, true, seq{main_x -> main_y}>
0.00/0.06	<l7, l10, true>
0.00/0.06	<l8, l9, true, seq{main_x -> (main_x - 1)}>
0.00/0.06	<l9, l10, true>
0.00/0.06	<l10, l11, true, seq{main_c -> (main_c + 1)}>
0.00/0.06	<l11, l4, true>
0.00/0.06	<l12, l13, true>
0.00/0.06	<l13, l14, 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	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l15, true, seq{main__func_return_ -> 0}>
0.00/0.06	<l15, l16, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l16, l17, true, seq{main_x -> varCall_1}>
0.00/0.06	<l17, l18, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l18, l1, true, seq{main_y -> varCall_2, main_c -> 0}>
0.00/0.06	<l1, l2, (main_x > 0)>
0.00/0.06	<l1, l13, not((main_x > 0))>
0.00/0.06	<l2, l3, (main_y > 0)>
0.00/0.06	<l2, l13, not((main_y > 0))>
0.00/0.06	<l3, l4, true>
0.00/0.06	<l4, l12, (main_x = 0)>
0.00/0.06	<l4, l5, not((main_x = 0))>
0.00/0.06	<l5, l6, (main_x > main_y)>
0.00/0.06	<l5, l8, not((main_x > main_y))>
0.00/0.06	<l6, l7, true, seq{main_x -> main_y}>
0.00/0.06	<l7, l10, true>
0.00/0.06	<l8, l9, true, seq{main_x -> (main_x - 1)}>
0.00/0.06	<l9, l10, true>
0.00/0.06	<l10, l11, true, seq{main_c -> (main_c + 1)}>
0.00/0.06	<l11, l4, true>
0.00/0.06	<l12, l13, true>
0.00/0.06	<l13, l14, 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	14, 
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 [5 idents]:
0.00/0.06	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 8, col: 9> <line: 9, col: 9>
0.00/0.06	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.06	c | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 18, col: 13> <line: 18, col: 17>
0.00/0.06	x | local variable | integer | <line: 7, col: 5> | <line: 8, col: 5> <line: 11, col: 9> <line: 12, col: 18> <line: 13, col: 17> <line: 14, col: 17> <line: 16, col: 17> <line: 16, col: 21>
0.00/0.06	y | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 11, col: 18> <line: 13, col: 21> <line: 14, col: 21>
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, l4, (main_c = 0) /\ (main_x = undef3) /\ (main_y = undef4) /\ (undef3 > 0) /\ (undef4 > 0)>
0.00/0.06	<l0, l14, (main_c = 0) /\ (main_x = undef3) /\ (main_y = undef4) /\ (undef3 > 0) /\ not((undef4 > 0))>
0.00/0.06	<l0, l14, (main_c = 0) /\ (main_x = undef3) /\ (main_y = undef4) /\ not((undef3 > 0))>
0.00/0.06	<l4, l14, (main_x = 0)>
0.00/0.06	<l4, l4, (main_x < 0) /\ (main_x > main_y), par{main_c -> (main_c + 1), main_x -> main_y}>
0.00/0.06	<l4, l4, (main_x < 0) /\ not((main_x > main_y)), par{main_c -> (main_c + 1), main_x -> (main_x - 1)}>
0.00/0.06	<l4, l4, (main_x > 0) /\ (main_x > main_y), par{main_c -> (main_c + 1), main_x -> main_y}>
0.00/0.06	<l4, l4, (main_x > 0) /\ not((main_x > main_y)), par{main_c -> (main_c + 1), main_x -> (main_x - 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	14, 
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	<l4, l4, 1 + main_x <= 0 /\ 1 + main_y <= main_x, {main_c -> 1 + main_c, main_x -> main_y, rest remain the same}>
0.00/0.06	<l4, l4, main_x <= main_y /\ 1 + main_x <= 0, {main_c -> 1 + main_c, main_x -> -1 + main_x, rest remain the same}>
0.00/0.06	<l4, l4, 1 <= main_x /\ 1 + main_y <= main_x, {main_c -> 1 + main_c, main_x -> main_y, rest remain the same}>
0.00/0.06	<l4, l4, main_x <= main_y /\ 1 <= main_x, {main_c -> 1 + main_c, main_x -> -1 + main_x, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_c, main_x, main_y
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, l4, 1 <= undef3 /\ 1 <= undef4 /\ main_c = 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l0, l14, undef4 <= 0 /\ 1 <= undef3 /\ main_c = 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.06	<l0, l14, undef3 <= 0 /\ main_c = 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.06	<l4, l14, main_x = 0, {all 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	( 4 , 1 )
0.00/0.06	( 14 , 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.011596
0.00/0.06	Some transition disabled by a set of invariant(s):
0.00/0.06	Invariant at l4: 1 <= main_y
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	<l4, l4, 1 + main_x <= 0 /\ 1 + main_y <= main_x, {main_c -> 1 + main_c, main_x -> main_y, 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	<l4, l4, main_x <= main_y /\ 1 + main_x <= 0 /\ 1 <= main_y, {main_c -> 1 + main_c, main_x -> -1 + main_x, 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	<l4, l4, 1 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_c -> 1 + main_c, main_x -> main_y, 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	<l4, l4, main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_c -> 1 + main_c, main_x -> -1 + main_x, rest remain the same}>
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.007715
0.00/0.06	Some transition disabled by a set of invariant(s):
0.00/0.06	Invariant at l4: 0 <= main_x
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	<l4, l4, main_x <= main_y /\ 1 + main_x <= 0 /\ 1 <= main_y, {main_c -> 1 + main_c, main_x -> -1 + main_x, 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	<l4, l4, 1 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_c -> 1 + main_c, main_x -> main_y, 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	<l4, l4, main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_c -> 1 + main_c, main_x -> -1 + main_x, rest remain the same}>
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.005694
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l4}...
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.001464s
0.00/0.06	Ranking function: -3 + 3*main_x - 3*main_y
0.00/0.06	New Graphs: 
0.00/0.06	Transitions:
0.00/0.06	<l4, l4, main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_c -> 1 + main_c, main_x -> -1 + main_x, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_c, main_x, main_y
0.00/0.06	Checking conditional termination of SCC {l4}...
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.000786s
0.00/0.06	Ranking function: -1 + main_x
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Analyzing SCC {l14}...
0.00/0.06	No cycles found.
0.00/0.06	
0.00/0.06	Program Terminates
0.00/0.06	EOF