0.00/0.18	YES
0.00/0.18	
0.00/0.18	Solver Timeout: 4
0.00/0.18	Global Timeout: 300
0.00/0.18	Maximum number of concurrent processes: 900
0.00/0.18	*******************************************************************************************
0.00/0.18	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.18	*******************************************************************************************
0.00/0.18	
0.00/0.18	
0.00/0.18	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.18	
0.00/0.18	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.18	+                                                                  +
0.00/0.18	Init Location: 0
0.00/0.18	Transitions:
0.00/0.18	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.18	<l1, l2, true>
0.00/0.18	<l2, l6, not(((main_x + main_y) >= 0))>
0.00/0.18	<l2, l3, ((main_x + main_y) >= 0)>
0.00/0.18	<l3, l6, not((main_x <= main_z))>
0.00/0.18	<l3, l4, (main_x <= main_z)>
0.00/0.18	<l4, l5, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}>
0.00/0.18	<l5, l2, true>
0.00/0.18	<l6, l7, true, seq{main__func_return_ -> 0}>
0.00/0.18	
0.00/0.18	Fresh variables:
0.00/0.18	
0.00/0.18	Undef variables:
0.00/0.18	
0.00/0.18	Abstraction variables:
0.00/0.18	
0.00/0.18	Exit nodes:
0.00/0.18	
0.00/0.18	Accepting locations:
0.00/0.18	
0.00/0.18	Asserts:
0.00/0.18	
0.00/0.18	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.18	       
0.00/0.18	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.18	       
0.00/0.18	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.18	
0.00/0.18	Init Location: 0
0.00/0.18	Transitions:
0.00/0.18	<l0, l8, true, seq{main__func_return_ -> 0}>
0.00/0.18	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.18	<l9, l10, true, seq{main_x -> varCall_1}>
0.00/0.18	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.18	<l11, l12, true, seq{main_y -> varCall_2}>
0.00/0.18	<l12, l13, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.18	<l13, l1, true, seq{main_z -> varCall_3}>
0.00/0.18	<l1, l2, true>
0.00/0.18	<l2, l3, ((main_x + main_y) >= 0)>
0.00/0.18	<l2, l6, not(((main_x + main_y) >= 0))>
0.00/0.18	<l3, l4, (main_x <= main_z)>
0.00/0.18	<l3, l6, not((main_x <= main_z))>
0.00/0.18	<l4, l5, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}>
0.00/0.18	<l5, l2, true>
0.00/0.18	<l6, l7, true, seq{main__func_return_ -> 0}>
0.00/0.18	
0.00/0.18	Fresh variables:
0.00/0.18	
0.00/0.18	Undef variables:
0.00/0.18	
0.00/0.18	Abstraction variables:
0.00/0.18	
0.00/0.18	Exit nodes:
0.00/0.18	7, 
0.00/0.18	Accepting locations:
0.00/0.18	
0.00/0.18	Asserts:
0.00/0.18	
0.00/0.18	+                                                                  +
0.00/0.18	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.18	
0.00/0.18	
0.00/0.18	Function Return and Parameters Information [2 functions]:
0.00/0.18	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.18	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.18	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.18	        main__func_return_      [function result] : int
0.00/0.18	
0.00/0.18	
0.00/0.18	AST Ident Scanner Information [5 idents]:
0.00/0.18	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9>
0.00/0.18	main | function | [integer, ()] | <line: 22, col: 1>
0.00/0.18	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 27, col: 12> <line: 27, col: 26> <line: 28, col: 9> <line: 28, col: 15>
0.00/0.18	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 27, col: 16> <line: 28, col: 19> <line: 29, col: 9> <line: 29, col: 13>
0.00/0.18	z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 27, col: 31>
0.00/0.18	
0.00/0.18	Main function: main
0.00/0.18	Preprocessed LLVMGraph
0.00/0.18	Init Location: 0
0.00/0.18	Transitions:
0.00/0.18	<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
0.00/0.18	<l2, l2, ((main_x + main_y) >= 0) /\ (main_x <= main_z), par{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}>
0.00/0.18	<l2, l7, ((main_x + main_y) >= 0) /\ not((main_x <= main_z))>
0.00/0.18	<l2, l7, not(((main_x + main_y) >= 0))>
0.00/0.18	
0.00/0.18	Fresh variables:
0.00/0.18	undef4, undef5, undef6, 
0.00/0.18	
0.00/0.18	Undef variables:
0.00/0.18	undef4, undef5, undef6, 
0.00/0.18	
0.00/0.18	Abstraction variables:
0.00/0.18	
0.00/0.18	Exit nodes:
0.00/0.18	7, 
0.00/0.18	Accepting locations:
0.00/0.18	
0.00/0.18	Asserts:
0.00/0.18	
0.00/0.18	*************************************************************
0.00/0.18	*******************************************************************************************
0.00/0.18	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.18	*******************************************************************************************
0.00/0.18	
0.00/0.18	Init Location: 0
0.00/0.18	Graph 0:
0.00/0.18	Transitions:
0.00/0.18	Variables:
0.00/0.18	
0.00/0.18	Graph 1:
0.00/0.18	Transitions:
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Variables:
0.00/0.18	main_x, main_y, main_z
0.00/0.18	
0.00/0.18	Graph 2:
0.00/0.18	Transitions:
0.00/0.18	Variables:
0.00/0.18	
0.00/0.18	Precedence: 
0.00/0.18	Graph 0
0.00/0.18	
0.00/0.18	Graph 1
0.00/0.18	<l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.18	
0.00/0.18	Graph 2
0.00/0.18	<l2, l7, 0 <= main_x + main_y /\ 1 + main_z <= main_x, {all remain the same}>
0.00/0.18	<l2, l7, 1 + main_x + main_y <= 0, {all remain the same}>
0.00/0.18	
0.00/0.18	Map Locations to Subgraph:
0.00/0.18	( 0 , 0 )
0.00/0.18	( 2 , 1 )
0.00/0.18	( 7 , 2 )
0.00/0.18	
0.00/0.18	*******************************************************************************************
0.00/0.18	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.18	*******************************************************************************************
0.00/0.18	
0.00/0.18	Proving termination of subgraph 0
0.00/0.18	Proving termination of subgraph 1
0.00/0.18	Checking unfeasibility...
0.00/0.18	Time used: 0.002725
0.00/0.18	
0.00/0.18	Checking conditional termination of SCC {l2}...
0.00/0.18	
0.00/0.18	LOG: CALL solveLinear
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear - Elapsed time: 0.000692s
0.00/0.18	
0.00/0.18	LOG: CALL solveLinear
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear - Elapsed time: 0.002014s
0.00/0.18	[42287 : 42289]
0.00/0.18	[42287 : 42290]
0.00/0.18	Successful child: 42289
0.00/0.18	[ Invariant Graph ]
0.00/0.18	Strengthening and disabling transitions...
0.00/0.18	
0.00/0.18	LOG: CALL solverLinear in Graph for feasibility
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.18	It's unfeasible. Removing transition: 
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	[ Termination Graph ]
0.00/0.18	Strengthening and disabling transitions...
0.00/0.18	> It's unfeasible. Removing transition: 
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	New Graphs: 
0.00/0.18	
0.00/0.18	LOG: CALL check - Post:1 + main_z <= main_x - Process 1
0.00/0.18	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.18	* Postcondition  : 1 + main_z <= main_x
0.00/0.18	
0.00/0.18	LOG: CALL solveLinear
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear - Elapsed time: 0.000604s
0.00/0.18	> Postcondition is not implied!
0.00/0.18	
0.00/0.18	LOG: RETURN check - Elapsed time: 0.000710s
0.00/0.18	INVARIANTS: 
0.00/0.18	2: 
0.00/0.18	Quasi-INVARIANTS to narrow Graph: 
0.00/0.18	2: 1 + main_z <= main_x , 
0.00/0.18	Narrowing transition: 
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	
0.00/0.18	LOG: Narrow transition size 1
0.00/0.18	invGraph after Narrowing: 
0.00/0.18	Transitions:
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Variables:
0.00/0.18	main_x, main_y, main_z
0.00/0.18	Checking conditional termination of SCC {l2}...
0.00/0.18	
0.00/0.18	LOG: CALL solveLinear
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear - Elapsed time: 0.000664s
0.00/0.18	
0.00/0.18	LOG: CALL solveLinear
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear - Elapsed time: 0.002146s
0.00/0.18	[42287 : 42294]
0.00/0.18	[42287 : 42295]
0.00/0.18	Successful child: 42294
0.00/0.18	[ Invariant Graph ]
0.00/0.18	Strengthening and disabling transitions...
0.00/0.18	
0.00/0.18	LOG: CALL solverLinear in Graph for feasibility
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.18	It's unfeasible. Removing transition: 
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	[ Termination Graph ]
0.00/0.18	Strengthening and disabling transitions...
0.00/0.18	> It's unfeasible. Removing transition: 
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	New Graphs: 
0.00/0.18	
0.00/0.18	LOG: CALL check - Post:1 + main_y + main_z <= 0 - Process 2
0.00/0.18	* Exit transition: <l0, l2, main_x <= main_z /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.18	* Postcondition  : 1 + main_y + main_z <= 0
0.00/0.18	
0.00/0.18	LOG: CALL solveLinear
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear - Elapsed time: 0.000702s
0.00/0.18	> Postcondition is not implied!
0.00/0.18	
0.00/0.18	LOG: RETURN check - Elapsed time: 0.000813s
0.00/0.18	INVARIANTS: 
0.00/0.18	2: 
0.00/0.18	Quasi-INVARIANTS to narrow Graph: 
0.00/0.18	2: 1 + main_y + main_z <= 0 , 
0.00/0.18	Narrowing transition: 
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	
0.00/0.18	LOG: Narrow transition size 1
0.00/0.18	invGraph after Narrowing: 
0.00/0.18	Transitions:
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y /\ 0 <= main_y + main_z, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Variables:
0.00/0.18	main_x, main_y, main_z
0.00/0.18	Checking conditional termination of SCC {l2}...
0.00/0.18	
0.00/0.18	LOG: CALL solveLinear
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear - Elapsed time: 0.000726s
0.00/0.18	
0.00/0.18	LOG: CALL solveLinear
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear - Elapsed time: 0.002471s
0.00/0.18	[42287 : 42299]
0.00/0.18	[42287 : 42300]
0.00/0.18	Successful child: 42299
0.00/0.18	[ Invariant Graph ]
0.00/0.18	Strengthening and disabling transitions...
0.00/0.18	
0.00/0.18	LOG: CALL solverLinear in Graph for feasibility
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.18	Strengthening transition (result): 
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_y + main_z /\ 1 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	[ Termination Graph ]
0.00/0.18	Strengthening and disabling transitions...
0.00/0.18	
0.00/0.18	LOG: CALL solverLinear in Graph for feasibility
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.18	Strengthening transition (result): 
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_y + main_z /\ 1 <= main_x + main_y, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Ranking function: -main_x + main_z
0.00/0.18	New Graphs: 
0.00/0.18	
0.00/0.18	LOG: CALL check - Post:1 <= main_x + main_y - Process 3
0.00/0.18	* Exit transition: <l0, l2, main_x <= main_z /\ 0 <= main_y + main_z /\ main_x = undef4 /\ main_y = undef5 /\ main_z = undef6, {all remain the same}>
0.00/0.18	* Postcondition  : 1 <= main_x + main_y
0.00/0.18	
0.00/0.18	LOG: CALL solveLinear
0.00/0.18	
0.00/0.18	LOG: RETURN solveLinear - Elapsed time: 0.000528s
0.00/0.18	> Postcondition is not implied!
0.00/0.18	
0.00/0.18	LOG: RETURN check - Elapsed time: 0.000652s
0.00/0.18	INVARIANTS: 
0.00/0.18	2: 
0.00/0.18	Quasi-INVARIANTS to narrow Graph: 
0.00/0.18	2: 1 <= main_x + main_y , 
0.00/0.18	It's unfeasible. Removing transition: 
0.00/0.18	<l2, l2, main_x <= main_z /\ 0 <= main_x + main_y /\ 0 <= main_y + main_z, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	invGraph after Narrowing: 
0.00/0.18	Transitions:
0.00/0.18	Variables:
0.00/0.18	main_x, main_y, main_z
0.00/0.18	Analyzing SCC {l2}...
0.00/0.18	No cycles found.
0.00/0.18	
0.00/0.18	Proving termination of subgraph 2
0.00/0.18	Analyzing SCC {l7}...
0.00/0.18	No cycles found.
0.00/0.18	
0.00/0.18	Program Terminates
0.00/0.18	EOF