0.00/0.14	YES
0.00/0.14	
0.00/0.14	Solver Timeout: 4
0.00/0.14	Global Timeout: 300
0.00/0.14	Maximum number of concurrent processes: 900
0.00/0.14	*******************************************************************************************
0.00/0.14	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.14	*******************************************************************************************
0.00/0.14	
0.00/0.14	
0.00/0.14	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.14	
0.00/0.14	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.14	+                                                                  +
0.00/0.14	Init Location: 0
0.00/0.14	Transitions:
0.00/0.14	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.14	<l1, l2, ((main_x + main_y) <= 0)>
0.00/0.14	<l1, l7, not(((main_x + main_y) <= 0))>
0.00/0.14	<l2, l3, true>
0.00/0.14	<l3, l6, not((main_x > 0))>
0.00/0.14	<l3, l4, (main_x > 0)>
0.00/0.14	<l4, l5, true, seq{main_x -> ((main_x + main_x) + main_y), main_y -> (main_y - 1)}>
0.00/0.14	<l5, l3, true>
0.00/0.14	<l6, l7, true>
0.00/0.14	<l7, l8, true, seq{main__func_return_ -> 0}>
0.00/0.15	
0.00/0.15	Fresh variables:
0.00/0.15	
0.00/0.15	Undef variables:
0.00/0.15	
0.00/0.15	Abstraction variables:
0.00/0.15	
0.00/0.15	Exit nodes:
0.00/0.15	
0.00/0.15	Accepting locations:
0.00/0.15	
0.00/0.15	Asserts:
0.00/0.15	
0.00/0.15	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.15	       
0.00/0.15	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.15	       
0.00/0.15	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.15	
0.00/0.15	Init Location: 0
0.00/0.15	Transitions:
0.00/0.15	<l0, l9, true, seq{main__func_return_ -> 0}>
0.00/0.15	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.15	<l10, l11, true, seq{main_x -> varCall_1}>
0.00/0.15	<l11, l12, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.15	<l12, l1, true, seq{main_y -> varCall_2}>
0.00/0.15	<l1, l2, ((main_x + main_y) <= 0)>
0.00/0.15	<l1, l7, not(((main_x + main_y) <= 0))>
0.00/0.15	<l2, l3, true>
0.00/0.15	<l3, l4, (main_x > 0)>
0.00/0.15	<l3, l6, not((main_x > 0))>
0.00/0.15	<l4, l5, true, seq{main_x -> ((main_x + main_x) + main_y), main_y -> (main_y - 1)}>
0.00/0.15	<l5, l3, true>
0.00/0.15	<l6, l7, true>
0.00/0.15	<l7, l8, true, seq{main__func_return_ -> 0}>
0.00/0.15	
0.00/0.15	Fresh variables:
0.00/0.15	
0.00/0.15	Undef variables:
0.00/0.15	
0.00/0.15	Abstraction variables:
0.00/0.15	
0.00/0.15	Exit nodes:
0.00/0.15	8, 
0.00/0.15	Accepting locations:
0.00/0.15	
0.00/0.15	Asserts:
0.00/0.15	
0.00/0.15	+                                                                  +
0.00/0.15	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.15	
0.00/0.15	
0.00/0.15	Function Return and Parameters Information [2 functions]:
0.00/0.15	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.15	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.15	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.15	        main__func_return_      [function result] : int
0.00/0.15	
0.00/0.15	
0.00/0.15	AST Ident Scanner Information [4 idents]:
0.00/0.15	__VERIFIER_nondet_int | function | [integer, ()] | <line: 8, col: 1> | <line: 14, col: 9> <line: 15, col: 9>
0.00/0.15	main | function | [integer, ()] | <line: 10, col: 1>
0.00/0.15	x | local variable | integer | <line: 12, col: 5> | <line: 14, col: 5> <line: 16, col: 9> <line: 17, col: 16> <line: 18, col: 13> <line: 18, col: 17> <line: 18, col: 21>
0.00/0.15	y | local variable | integer | <line: 13, col: 5> | <line: 15, col: 5> <line: 16, col: 13> <line: 18, col: 25> <line: 19, col: 13> <line: 19, col: 17>
0.00/0.15	
0.00/0.15	Main function: main
0.00/0.15	Preprocessed LLVMGraph
0.00/0.15	Init Location: 0
0.00/0.15	Transitions:
0.00/0.15	<l0, l3, (main_x = undef3) /\ (main_y = undef4) /\ ((undef3 + undef4) <= 0)>
0.00/0.15	<l0, l8, (main_x = undef3) /\ (main_y = undef4) /\ not(((undef3 + undef4) <= 0))>
0.00/0.15	<l3, l3, (main_x > 0), par{main_x -> ((main_x + main_x) + main_y), main_y -> (main_y - 1)}>
0.00/0.15	<l3, l8, not((main_x > 0))>
0.00/0.15	
0.00/0.15	Fresh variables:
0.00/0.15	undef3, undef4, 
0.00/0.15	
0.00/0.15	Undef variables:
0.00/0.15	undef3, undef4, 
0.00/0.15	
0.00/0.15	Abstraction variables:
0.00/0.15	
0.00/0.15	Exit nodes:
0.00/0.15	8, 
0.00/0.15	Accepting locations:
0.00/0.15	
0.00/0.15	Asserts:
0.00/0.15	
0.00/0.15	*************************************************************
0.00/0.15	*******************************************************************************************
0.00/0.15	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.15	*******************************************************************************************
0.00/0.15	
0.00/0.15	Init Location: 0
0.00/0.15	Graph 0:
0.00/0.15	Transitions:
0.00/0.15	Variables:
0.00/0.15	
0.00/0.15	Graph 1:
0.00/0.15	Transitions:
0.00/0.15	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	Variables:
0.00/0.15	main_x, main_y
0.00/0.15	
0.00/0.15	Graph 2:
0.00/0.15	Transitions:
0.00/0.15	Variables:
0.00/0.15	
0.00/0.15	Precedence: 
0.00/0.15	Graph 0
0.00/0.15	
0.00/0.15	Graph 1
0.00/0.15	<l0, l3, undef3 + undef4 <= 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.15	
0.00/0.15	Graph 2
0.00/0.15	<l0, l8, 1 <= undef3 + undef4 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.15	<l3, l8, main_x <= 0, {all remain the same}>
0.00/0.15	
0.00/0.15	Map Locations to Subgraph:
0.00/0.15	( 0 , 0 )
0.00/0.15	( 3 , 1 )
0.00/0.15	( 8 , 2 )
0.00/0.15	
0.00/0.15	*******************************************************************************************
0.00/0.15	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.15	*******************************************************************************************
0.00/0.15	
0.00/0.15	Proving termination of subgraph 0
0.00/0.15	Proving termination of subgraph 1
0.00/0.15	Checking unfeasibility...
0.00/0.15	Time used: 0.002583
0.00/0.15	
0.00/0.15	Checking conditional termination of SCC {l3}...
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.000524s
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.001566s
0.00/0.15	[63995 : 63997]
0.00/0.15	[63995 : 63998]
0.00/0.15	Successful child: 63997
0.00/0.15	[ Invariant Graph ]
0.00/0.15	Strengthening and disabling transitions...
0.00/0.15	
0.00/0.15	LOG: CALL solverLinear in Graph for feasibility
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.15	It's unfeasible. Removing transition: 
0.00/0.15	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	[ Termination Graph ]
0.00/0.15	Strengthening and disabling transitions...
0.00/0.15	> It's unfeasible. Removing transition: 
0.00/0.15	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	New Graphs: 
0.00/0.15	
0.00/0.15	LOG: CALL check - Post:main_x <= 0 - Process 1
0.00/0.15	* Exit transition: <l0, l3, undef3 + undef4 <= 0 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.15	* Postcondition  : main_x <= 0
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.000381s
0.00/0.15	> Postcondition is not implied!
0.00/0.15	
0.00/0.15	LOG: RETURN check - Elapsed time: 0.000490s
0.00/0.15	INVARIANTS: 
0.00/0.15	3: 
0.00/0.15	Quasi-INVARIANTS to narrow Graph: 
0.00/0.15	3: main_x <= 0 , 
0.00/0.15	Narrowing transition: 
0.00/0.15	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	
0.00/0.15	LOG: Narrow transition size 1
0.00/0.15	invGraph after Narrowing: 
0.00/0.15	Transitions:
0.00/0.15	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	Variables:
0.00/0.15	main_x, main_y
0.00/0.15	Checking conditional termination of SCC {l3}...
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.000495s
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.001676s
0.00/0.15	[63995 : 64002]
0.00/0.15	[63995 : 64003]
0.00/0.15	Successful child: 64002
0.00/0.15	[ Invariant Graph ]
0.00/0.15	Strengthening and disabling transitions...
0.00/0.15	
0.00/0.15	LOG: CALL solverLinear in Graph for feasibility
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.15	Strengthening transition (result): 
0.00/0.15	<l3, l3, 1 + main_x + main_y <= 0 /\ 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	[ Termination Graph ]
0.00/0.15	Strengthening and disabling transitions...
0.00/0.15	
0.00/0.15	LOG: CALL solverLinear in Graph for feasibility
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.15	Strengthening transition (result): 
0.00/0.15	<l3, l3, 1 + main_x + main_y <= 0 /\ 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	Ranking function: 2 + main_x
0.00/0.15	New Graphs: 
0.00/0.15	
0.00/0.15	LOG: CALL check - Post:1 + main_x + main_y <= 0 - Process 2
0.00/0.15	* Exit transition: <l0, l3, undef3 + undef4 <= 0 /\ 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.15	* Postcondition  : 1 + main_x + main_y <= 0
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.000426s
0.00/0.15	> Postcondition is not implied!
0.00/0.15	
0.00/0.15	LOG: RETURN check - Elapsed time: 0.000538s
0.00/0.15	INVARIANTS: 
0.00/0.15	3: 
0.00/0.15	Quasi-INVARIANTS to narrow Graph: 
0.00/0.15	3: 1 + main_x + main_y <= 0 , 
0.00/0.15	Narrowing transition: 
0.00/0.15	<l3, l3, 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	
0.00/0.15	LOG: Narrow transition size 1
0.00/0.15	invGraph after Narrowing: 
0.00/0.15	Transitions:
0.00/0.15	<l3, l3, 0 <= main_x + main_y /\ 1 <= main_x, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	Variables:
0.00/0.15	main_x, main_y
0.00/0.15	Checking conditional termination of SCC {l3}...
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.000569s
0.00/0.15	
0.00/0.15	LOG: CALL solveLinear
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear - Elapsed time: 0.001980s
0.00/0.15	[63995 : 64007]
0.00/0.15	[63995 : 64008]
0.00/0.15	Successful child: 64007
0.00/0.15	[ Invariant Graph ]
0.00/0.15	Strengthening and disabling transitions...
0.00/0.15	
0.00/0.15	LOG: CALL solverLinear in Graph for feasibility
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.15	Strengthening transition (result): 
0.00/0.15	<l3, l3, 1 <= main_x /\ main_x + main_y = 0, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	[ Termination Graph ]
0.00/0.15	Strengthening and disabling transitions...
0.00/0.15	
0.00/0.15	LOG: CALL solverLinear in Graph for feasibility
0.00/0.15	
0.00/0.15	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.15	Strengthening transition (result): 
0.00/0.15	<l3, l3, 1 <= main_x /\ main_x + main_y = 0, {main_x -> 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.15	Ranking function: main_x + main_y
0.00/0.15	New Graphs: 
0.00/0.15	INVARIANTS: 
0.00/0.15	3: main_x + main_y <= 0 , 
0.00/0.15	Quasi-INVARIANTS to narrow Graph: 
0.00/0.15	3: 
0.00/0.15	Proving termination of subgraph 2
0.00/0.15	Analyzing SCC {l8}...
0.00/0.15	No cycles found.
0.00/0.15	
0.00/0.15	Program Terminates
0.00/0.15	EOF