0.00/0.17	YES
0.00/0.17	
0.00/0.17	Solver Timeout: 4
0.00/0.17	Global Timeout: 300
0.00/0.17	Maximum number of concurrent processes: 900
0.00/0.17	*******************************************************************************************
0.00/0.17	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.17	*******************************************************************************************
0.00/0.17	
0.00/0.17	
0.00/0.17	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.17	
0.00/0.17	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.17	+                                                                  +
0.00/0.17	Init Location: 0
0.00/0.17	Transitions:
0.00/0.17	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.17	<l1, l2, true>
0.00/0.17	<l2, l5, not((main_x > 0))>
0.00/0.17	<l2, l3, (main_x > 0)>
0.00/0.17	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y - 1)}>
0.00/0.17	<l4, l2, true>
0.00/0.17	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.17	
0.00/0.17	Fresh variables:
0.00/0.17	
0.00/0.17	Undef variables:
0.00/0.17	
0.00/0.17	Abstraction variables:
0.00/0.17	
0.00/0.17	Exit nodes:
0.00/0.17	
0.00/0.17	Accepting locations:
0.00/0.17	
0.00/0.17	Asserts:
0.00/0.17	
0.00/0.17	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.17	       
0.00/0.17	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.17	       
0.00/0.17	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.17	
0.00/0.17	Init Location: 0
0.00/0.17	Transitions:
0.00/0.17	<l0, l7, true, seq{main__func_return_ -> 0}>
0.00/0.17	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.17	<l8, l9, true, seq{main_x -> varCall_1}>
0.00/0.17	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.17	<l10, l1, true, seq{main_y -> varCall_2}>
0.00/0.17	<l1, l2, true>
0.00/0.17	<l2, l3, (main_x > 0)>
0.00/0.17	<l2, l5, not((main_x > 0))>
0.00/0.17	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y - 1)}>
0.00/0.17	<l4, l2, true>
0.00/0.17	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.17	
0.00/0.17	Fresh variables:
0.00/0.17	
0.00/0.17	Undef variables:
0.00/0.17	
0.00/0.17	Abstraction variables:
0.00/0.17	
0.00/0.17	Exit nodes:
0.00/0.17	6, 
0.00/0.17	Accepting locations:
0.00/0.17	
0.00/0.17	Asserts:
0.00/0.17	
0.00/0.17	+                                                                  +
0.00/0.17	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.17	
0.00/0.17	
0.00/0.17	Function Return and Parameters Information [2 functions]:
0.00/0.17	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.17	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.17	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.17	        main__func_return_      [function result] : int
0.00/0.17	
0.00/0.17	
0.00/0.17	AST Ident Scanner Information [4 idents]:
0.00/0.17	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9>
0.00/0.17	main | function | [integer, ()] | <line: 22, col: 1>
0.00/0.17	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 27, col: 9> <line: 27, col: 13>
0.00/0.17	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 27, col: 17> <line: 28, col: 9> <line: 28, col: 13>
0.00/0.17	
0.00/0.17	Main function: main
0.00/0.17	Preprocessed LLVMGraph
0.00/0.17	Init Location: 0
0.00/0.17	Transitions:
0.00/0.17	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
0.00/0.17	<l2, l2, (main_x > 0), par{main_x -> (main_x + main_y), main_y -> (main_y - 1)}>
0.00/0.17	<l2, l6, not((main_x > 0))>
0.00/0.17	
0.00/0.17	Fresh variables:
0.00/0.17	undef3, undef4, 
0.00/0.17	
0.00/0.17	Undef variables:
0.00/0.17	undef3, undef4, 
0.00/0.17	
0.00/0.17	Abstraction variables:
0.00/0.17	
0.00/0.17	Exit nodes:
0.00/0.17	6, 
0.00/0.17	Accepting locations:
0.00/0.17	
0.00/0.17	Asserts:
0.00/0.17	
0.00/0.17	*************************************************************
0.00/0.17	*******************************************************************************************
0.00/0.17	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.17	*******************************************************************************************
0.00/0.17	
0.00/0.17	Init Location: 0
0.00/0.17	Graph 0:
0.00/0.17	Transitions:
0.00/0.17	Variables:
0.00/0.17	
0.00/0.17	Graph 1:
0.00/0.17	Transitions:
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	Variables:
0.00/0.17	main_x, main_y
0.00/0.17	
0.00/0.17	Graph 2:
0.00/0.17	Transitions:
0.00/0.17	Variables:
0.00/0.17	
0.00/0.17	Precedence: 
0.00/0.17	Graph 0
0.00/0.17	
0.00/0.17	Graph 1
0.00/0.17	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.17	
0.00/0.17	Graph 2
0.00/0.17	<l2, l6, main_x <= 0, {all remain the same}>
0.00/0.17	
0.00/0.17	Map Locations to Subgraph:
0.00/0.17	( 0 , 0 )
0.00/0.17	( 2 , 1 )
0.00/0.17	( 6 , 2 )
0.00/0.17	
0.00/0.17	*******************************************************************************************
0.00/0.17	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.17	*******************************************************************************************
0.00/0.17	
0.00/0.17	Proving termination of subgraph 0
0.00/0.17	Proving termination of subgraph 1
0.00/0.17	Checking unfeasibility...
0.00/0.17	Time used: 0.001984
0.00/0.17	
0.00/0.17	Checking conditional termination of SCC {l2}...
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000484s
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.001406s
0.00/0.17	[17217 : 17219]
0.00/0.17	[17217 : 17220]
0.00/0.17	Successful child: 17219
0.00/0.17	[ Invariant Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	It's unfeasible. Removing transition: 
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	[ Termination Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	> It's unfeasible. Removing transition: 
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	New Graphs: 
0.00/0.17	
0.00/0.17	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
0.00/0.17	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.17	* Postcondition  : 1 + main_x <= 0
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000460s
0.00/0.17	> Postcondition is not implied!
0.00/0.17	
0.00/0.17	LOG: RETURN check - Elapsed time: 0.000561s
0.00/0.17	INVARIANTS: 
0.00/0.17	2: 
0.00/0.17	Quasi-INVARIANTS to narrow Graph: 
0.00/0.17	2: 1 + main_x <= 0 , 
0.00/0.17	Narrowing transition: 
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	
0.00/0.17	LOG: Narrow transition size 1
0.00/0.17	invGraph after Narrowing: 
0.00/0.17	Transitions:
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	Variables:
0.00/0.17	main_x, main_y
0.00/0.17	Checking conditional termination of SCC {l2}...
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000476s
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.001548s
0.00/0.17	[17217 : 17224]
0.00/0.17	[17217 : 17225]
0.00/0.17	Successful child: 17224
0.00/0.17	[ Invariant Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	It's unfeasible. Removing transition: 
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	[ Termination Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	> It's unfeasible. Removing transition: 
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	New Graphs: 
0.00/0.17	
0.00/0.17	LOG: CALL check - Post:main_x <= 0 - Process 2
0.00/0.17	* Exit transition: <l0, l2, 0 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.17	* Postcondition  : main_x <= 0
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000544s
0.00/0.17	> Postcondition is not implied!
0.00/0.17	
0.00/0.17	LOG: RETURN check - Elapsed time: 0.000638s
0.00/0.17	INVARIANTS: 
0.00/0.17	2: 
0.00/0.17	Quasi-INVARIANTS to narrow Graph: 
0.00/0.17	2: main_x <= 0 , 
0.00/0.17	Narrowing transition: 
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	
0.00/0.17	LOG: Narrow transition size 1
0.00/0.17	invGraph after Narrowing: 
0.00/0.17	Transitions:
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	Variables:
0.00/0.17	main_x, main_y
0.00/0.17	Checking conditional termination of SCC {l2}...
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000471s
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.001523s
0.00/0.17	[17217 : 17229]
0.00/0.17	[17217 : 17230]
0.00/0.17	Successful child: 17229
0.00/0.17	[ Invariant Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	Strengthening transition (result): 
0.00/0.17	<l2, l2, main_x + main_y <= 0 /\ 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	[ Termination Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	Strengthening transition (result): 
0.00/0.17	<l2, l2, main_x + main_y <= 0 /\ 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	Ranking function: main_x
0.00/0.17	New Graphs: 
0.00/0.17	
0.00/0.17	LOG: CALL check - Post:main_x + main_y <= 0 - Process 3
0.00/0.17	* Exit transition: <l0, l2, 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.17	* Postcondition  : main_x + main_y <= 0
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000517s
0.00/0.17	> Postcondition is not implied!
0.00/0.17	
0.00/0.17	LOG: RETURN check - Elapsed time: 0.000617s
0.00/0.17	INVARIANTS: 
0.00/0.17	2: 
0.00/0.17	Quasi-INVARIANTS to narrow Graph: 
0.00/0.17	2: main_x + main_y <= 0 , 
0.00/0.17	Narrowing transition: 
0.00/0.17	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	
0.00/0.17	LOG: Narrow transition size 1
0.00/0.17	invGraph after Narrowing: 
0.00/0.17	Transitions:
0.00/0.17	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	Variables:
0.00/0.17	main_x, main_y
0.00/0.17	Checking conditional termination of SCC {l2}...
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000579s
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.002072s
0.00/0.17	[17217 : 17234]
0.00/0.17	[17217 : 17235]
0.00/0.17	Successful child: 17234
0.00/0.17	[ Invariant Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	Strengthening transition (result): 
0.00/0.17	<l2, l2, main_y <= 0 /\ 1 <= main_x /\ 1 <= main_x + main_y, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	[ Termination Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	Strengthening transition (result): 
0.00/0.17	<l2, l2, main_y <= 0 /\ 1 <= main_x /\ 1 <= main_x + main_y, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	Ranking function: 2*main_x + main_y
0.00/0.17	New Graphs: 
0.00/0.17	
0.00/0.17	LOG: CALL check - Post:main_y <= 0 - Process 4
0.00/0.17	* Exit transition: <l0, l2, 1 <= main_x /\ 1 <= main_x + main_y /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.17	* Postcondition  : main_y <= 0
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000444s
0.00/0.17	> Postcondition is not implied!
0.00/0.17	
0.00/0.17	LOG: RETURN check - Elapsed time: 0.000548s
0.00/0.17	INVARIANTS: 
0.00/0.17	2: 
0.00/0.17	Quasi-INVARIANTS to narrow Graph: 
0.00/0.17	2: main_y <= 0 , 
0.00/0.17	Narrowing transition: 
0.00/0.17	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	
0.00/0.17	LOG: Narrow transition size 1
0.00/0.17	invGraph after Narrowing: 
0.00/0.17	Transitions:
0.00/0.17	<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y, {main_x -> main_x + main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.17	Variables:
0.00/0.17	main_x, main_y
0.00/0.17	Checking conditional termination of SCC {l2}...
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000856s
0.00/0.17	Ranking function: -1 + main_y
0.00/0.17	New Graphs: 
0.00/0.17	Proving termination of subgraph 2
0.00/0.17	Analyzing SCC {l6}...
0.00/0.17	No cycles found.
0.00/0.17	
0.00/0.17	Program Terminates
0.00/0.17	EOF