0.00/0.40	YES
0.00/0.40	
0.00/0.41	Solver Timeout: 4
0.00/0.41	Global Timeout: 300
0.00/0.41	Maximum number of concurrent processes: 900
0.00/0.41	*******************************************************************************************
0.00/0.41	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.41	*******************************************************************************************
0.00/0.41	
0.00/0.41	
0.00/0.41	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.41	
0.00/0.41	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.41	+                                                                  +
0.00/0.41	Init Location: 0
0.00/0.41	Transitions:
0.00/0.41	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.41	<l1, l2, true>
0.00/0.41	<l2, l5, not((main_x > 0))>
0.00/0.41	<l2, l3, (main_x > 0)>
0.00/0.41	<l3, l4, true, seq{main_x -> main_y, main_y -> (main_y - 1)}>
0.00/0.41	<l4, l2, true>
0.00/0.41	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.41	
0.00/0.41	Fresh variables:
0.00/0.41	
0.00/0.41	Undef variables:
0.00/0.41	
0.00/0.41	Abstraction variables:
0.00/0.41	
0.00/0.41	Exit nodes:
0.00/0.41	
0.00/0.41	Accepting locations:
0.00/0.41	
0.00/0.41	Asserts:
0.00/0.41	
0.00/0.41	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.41	       
0.00/0.41	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.41	       
0.00/0.41	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.41	
0.00/0.41	Init Location: 0
0.00/0.41	Transitions:
0.00/0.41	<l0, l7, true, seq{main__func_return_ -> 0}>
0.00/0.41	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.41	<l8, l9, true, seq{main_x -> varCall_1}>
0.00/0.41	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.41	<l10, l1, true, seq{main_y -> varCall_2}>
0.00/0.41	<l1, l2, true>
0.00/0.41	<l2, l3, (main_x > 0)>
0.00/0.41	<l2, l5, not((main_x > 0))>
0.00/0.41	<l3, l4, true, seq{main_x -> main_y, main_y -> (main_y - 1)}>
0.00/0.41	<l4, l2, true>
0.00/0.41	<l5, l6, true, seq{main__func_return_ -> 0}>
0.00/0.41	
0.00/0.41	Fresh variables:
0.00/0.41	
0.00/0.41	Undef variables:
0.00/0.41	
0.00/0.41	Abstraction variables:
0.00/0.41	
0.00/0.41	Exit nodes:
0.00/0.41	6, 
0.00/0.41	Accepting locations:
0.00/0.41	
0.00/0.41	Asserts:
0.00/0.41	
0.00/0.41	+                                                                  +
0.00/0.41	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.41	
0.00/0.41	
0.00/0.41	Function Return and Parameters Information [2 functions]:
0.00/0.41	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.41	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.41	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.41	        main__func_return_      [function result] : int
0.00/0.41	
0.00/0.41	
0.00/0.41	AST Ident Scanner Information [4 idents]:
0.00/0.41	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9>
0.00/0.41	main | function | [integer, ()] | <line: 22, col: 1>
0.00/0.41	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 27, col: 9>
0.00/0.41	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 27, col: 13> <line: 28, col: 9> <line: 28, col: 13>
0.00/0.41	
0.00/0.41	Main function: main
0.00/0.41	Preprocessed LLVMGraph
0.00/0.41	Init Location: 0
0.00/0.41	Transitions:
0.00/0.41	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
0.00/0.41	<l2, l2, (main_x > 0), par{main_x -> main_y, main_y -> (main_y - 1)}>
0.00/0.41	<l2, l6, not((main_x > 0))>
0.00/0.41	
0.00/0.41	Fresh variables:
0.00/0.41	undef3, undef4, 
0.00/0.41	
0.00/0.41	Undef variables:
0.00/0.41	undef3, undef4, 
0.00/0.41	
0.00/0.41	Abstraction variables:
0.00/0.41	
0.00/0.41	Exit nodes:
0.00/0.41	6, 
0.00/0.41	Accepting locations:
0.00/0.41	
0.00/0.41	Asserts:
0.00/0.41	
0.00/0.41	*************************************************************
0.00/0.41	*******************************************************************************************
0.00/0.41	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.41	*******************************************************************************************
0.00/0.41	
0.00/0.41	Init Location: 0
0.00/0.41	Graph 0:
0.00/0.41	Transitions:
0.00/0.41	Variables:
0.00/0.41	
0.00/0.41	Graph 1:
0.00/0.41	Transitions:
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	Variables:
0.00/0.41	main_x, main_y
0.00/0.41	
0.00/0.41	Graph 2:
0.00/0.41	Transitions:
0.00/0.41	Variables:
0.00/0.41	
0.00/0.41	Precedence: 
0.00/0.41	Graph 0
0.00/0.41	
0.00/0.41	Graph 1
0.00/0.41	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.41	
0.00/0.41	Graph 2
0.00/0.41	<l2, l6, main_x <= 0, {all remain the same}>
0.00/0.41	
0.00/0.41	Map Locations to Subgraph:
0.00/0.41	( 0 , 0 )
0.00/0.41	( 2 , 1 )
0.00/0.41	( 6 , 2 )
0.00/0.41	
0.00/0.41	*******************************************************************************************
0.00/0.41	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.41	*******************************************************************************************
0.00/0.41	
0.00/0.41	Proving termination of subgraph 0
0.00/0.41	Proving termination of subgraph 1
0.00/0.41	Checking unfeasibility...
0.00/0.41	Time used: 0.001993
0.00/0.41	
0.00/0.41	Checking conditional termination of SCC {l2}...
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000512s
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.001427s
0.00/0.41	[823 : 825]
0.00/0.41	[823 : 827]
0.00/0.41	Successful child: 825
0.00/0.41	[ Invariant Graph ]
0.00/0.41	Strengthening and disabling transitions...
0.00/0.41	
0.00/0.41	LOG: CALL solverLinear in Graph for feasibility
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.41	It's unfeasible. Removing transition: 
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	[ Termination Graph ]
0.00/0.41	Strengthening and disabling transitions...
0.00/0.41	> It's unfeasible. Removing transition: 
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	New Graphs: 
0.00/0.41	
0.00/0.41	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
0.00/0.41	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.41	* Postcondition  : 1 + main_x <= 0
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000459s
0.00/0.41	> Postcondition is not implied!
0.00/0.41	
0.00/0.41	LOG: RETURN check - Elapsed time: 0.000562s
0.00/0.41	INVARIANTS: 
0.00/0.41	2: 
0.00/0.41	Quasi-INVARIANTS to narrow Graph: 
0.00/0.41	2: 1 + main_x <= 0 , 
0.00/0.41	Narrowing transition: 
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	
0.00/0.41	LOG: Narrow transition size 1
0.00/0.41	invGraph after Narrowing: 
0.00/0.41	Transitions:
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	Variables:
0.00/0.41	main_x, main_y
0.00/0.41	Checking conditional termination of SCC {l2}...
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000495s
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.001562s
0.00/0.41	[823 : 831]
0.00/0.41	[823 : 832]
0.00/0.41	Successful child: 831
0.00/0.41	[ Invariant Graph ]
0.00/0.41	Strengthening and disabling transitions...
0.00/0.41	
0.00/0.41	LOG: CALL solverLinear in Graph for feasibility
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.41	It's unfeasible. Removing transition: 
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	[ Termination Graph ]
0.00/0.41	Strengthening and disabling transitions...
0.00/0.41	> It's unfeasible. Removing transition: 
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	New Graphs: 
0.00/0.41	
0.00/0.41	LOG: CALL check - Post:main_x <= 0 - Process 2
0.00/0.41	* Exit transition: <l0, l2, 0 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.41	* Postcondition  : main_x <= 0
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000554s
0.00/0.41	> Postcondition is not implied!
0.00/0.41	
0.00/0.41	LOG: RETURN check - Elapsed time: 0.000649s
0.00/0.41	INVARIANTS: 
0.00/0.41	2: 
0.00/0.41	Quasi-INVARIANTS to narrow Graph: 
0.00/0.41	2: main_x <= 0 , 
0.00/0.41	Narrowing transition: 
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	
0.00/0.41	LOG: Narrow transition size 1
0.00/0.41	invGraph after Narrowing: 
0.00/0.41	Transitions:
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	Variables:
0.00/0.41	main_x, main_y
0.00/0.41	Checking conditional termination of SCC {l2}...
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000480s
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.001540s
0.00/0.41	[823 : 837]
0.00/0.41	[823 : 842]
0.00/0.41	Successful child: 837
0.00/0.41	[ Invariant Graph ]
0.00/0.41	Strengthening and disabling transitions...
0.00/0.41	
0.00/0.41	LOG: CALL solverLinear in Graph for feasibility
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.41	Strengthening transition (result): 
0.00/0.41	<l2, l2, 1 <= main_x /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	[ Termination Graph ]
0.00/0.41	Strengthening and disabling transitions...
0.00/0.41	
0.00/0.41	LOG: CALL solverLinear in Graph for feasibility
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.41	Strengthening transition (result): 
0.00/0.41	<l2, l2, 1 <= main_x /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	Ranking function: main_x
0.00/0.41	New Graphs: 
0.00/0.41	
0.00/0.41	LOG: CALL check - Post:main_x + main_y <= 1 - Process 3
0.00/0.41	* Exit transition: <l0, l2, 1 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.41	* Postcondition  : main_x + main_y <= 1
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000513s
0.00/0.41	> Postcondition is not implied!
0.00/0.41	
0.00/0.41	LOG: RETURN check - Elapsed time: 0.000615s
0.00/0.41	INVARIANTS: 
0.00/0.41	2: 
0.00/0.41	Quasi-INVARIANTS to narrow Graph: 
0.00/0.41	2: main_x + main_y <= 1 , 
0.00/0.41	Narrowing transition: 
0.00/0.41	<l2, l2, 1 <= main_x, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	
0.00/0.41	LOG: Narrow transition size 1
0.00/0.41	invGraph after Narrowing: 
0.00/0.41	Transitions:
0.00/0.41	<l2, l2, 1 <= main_x /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	Variables:
0.00/0.41	main_x, main_y
0.00/0.41	Checking conditional termination of SCC {l2}...
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000586s
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.002140s
0.00/0.41	[823 : 846]
0.00/0.41	[823 : 847]
0.00/0.41	Successful child: 846
0.00/0.41	[ Invariant Graph ]
0.00/0.41	Strengthening and disabling transitions...
0.00/0.41	
0.00/0.41	LOG: CALL solverLinear in Graph for feasibility
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.41	Strengthening transition (result): 
0.00/0.41	<l2, l2, 1 <= main_x /\ main_y <= 1 /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	[ Termination Graph ]
0.00/0.41	Strengthening and disabling transitions...
0.00/0.41	
0.00/0.41	LOG: CALL solverLinear in Graph for feasibility
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.41	Strengthening transition (result): 
0.00/0.41	<l2, l2, 1 <= main_x /\ main_y <= 1 /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	Ranking function: main_x + main_y
0.00/0.41	New Graphs: 
0.00/0.41	
0.00/0.41	LOG: CALL check - Post:main_y <= 1 - Process 4
0.00/0.41	* Exit transition: <l0, l2, 1 <= main_x /\ 2 <= main_x + main_y /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.41	* Postcondition  : main_y <= 1
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000446s
0.00/0.41	> Postcondition is not implied!
0.00/0.41	
0.00/0.41	LOG: RETURN check - Elapsed time: 0.000551s
0.00/0.41	INVARIANTS: 
0.00/0.41	2: 
0.00/0.41	Quasi-INVARIANTS to narrow Graph: 
0.00/0.41	2: main_y <= 1 , 
0.00/0.41	Narrowing transition: 
0.00/0.41	<l2, l2, 1 <= main_x /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	
0.00/0.41	LOG: Narrow transition size 1
0.00/0.41	invGraph after Narrowing: 
0.00/0.41	Transitions:
0.00/0.41	<l2, l2, 1 <= main_x /\ 2 <= main_x + main_y /\ 2 <= main_y, {main_x -> main_y, main_y -> -1 + main_y, rest remain the same}>
0.00/0.41	Variables:
0.00/0.41	main_x, main_y
0.00/0.41	Checking conditional termination of SCC {l2}...
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000872s
0.00/0.41	Ranking function: -2 + main_y
0.00/0.41	New Graphs: 
0.00/0.41	Proving termination of subgraph 2
0.00/0.41	Analyzing SCC {l6}...
0.00/0.41	No cycles found.
0.00/0.41	
0.00/0.41	Program Terminates
0.00/0.41	EOF