0.00/0.17	YES
0.00/0.17	
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_q -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.18	<l1, l2, true>
0.00/0.18	<l2, l5, not((main_q > 0))>
0.00/0.18	<l2, l3, (main_q > 0)>
0.00/0.18	<l3, l4, true, seq{main_q -> (main_q - main_y), main_y -> (main_y + 1)}>
0.00/0.18	<l4, l2, true>
0.00/0.18	<l5, l6, 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, l7, true, seq{main__func_return_ -> 0}>
0.00/0.18	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.18	<l8, l9, true, seq{main_q -> varCall_1}>
0.00/0.18	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.18	<l10, l1, true, seq{main_y -> varCall_2}>
0.00/0.18	<l1, l2, true>
0.00/0.18	<l2, l3, (main_q > 0)>
0.00/0.18	<l2, l5, not((main_q > 0))>
0.00/0.18	<l3, l4, true, seq{main_q -> (main_q - main_y), main_y -> (main_y + 1)}>
0.00/0.18	<l4, l2, true>
0.00/0.18	<l5, l6, 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	6, 
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 [4 idents]:
0.00/0.18	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 6>
0.00/0.18	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.18	q | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 17, col: 9> <line: 18, col: 3> <line: 18, col: 7>
0.00/0.18	y | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 18, col: 11> <line: 19, col: 3> <line: 19, col: 7>
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_q = undef3) /\ (main_y = undef4)>
0.00/0.18	<l2, l2, (main_q > 0), par{main_q -> (main_q - main_y), main_y -> (main_y + 1)}>
0.00/0.18	<l2, l6, not((main_q > 0))>
0.00/0.18	
0.00/0.18	Fresh variables:
0.00/0.18	undef3, undef4, 
0.00/0.18	
0.00/0.18	Undef variables:
0.00/0.18	undef3, undef4, 
0.00/0.18	
0.00/0.18	Abstraction variables:
0.00/0.18	
0.00/0.18	Exit nodes:
0.00/0.18	6, 
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, 1 <= main_q, {main_q -> main_q - main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Variables:
0.00/0.18	main_q, main_y
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_q = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.18	
0.00/0.18	Graph 2
0.00/0.18	<l2, l6, main_q <= 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	( 6 , 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.002007
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.000711s
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.001641s
0.00/0.18	[61849 : 61851]
0.00/0.18	[61849 : 61852]
0.00/0.18	Successful child: 61851
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, 1 <= main_q, {main_q -> main_q - 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, 1 <= main_q, {main_q -> main_q - 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_q <= 0 - Process 1
0.00/0.18	* Exit transition: <l0, l2, main_q = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.18	* Postcondition  : 1 + main_q <= 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.000466s
0.00/0.18	> Postcondition is not implied!
0.00/0.18	
0.00/0.18	LOG: RETURN check - Elapsed time: 0.000557s
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_q <= 0 , 
0.00/0.18	Narrowing transition: 
0.00/0.18	<l2, l2, 1 <= main_q, {main_q -> main_q - 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, 1 <= main_q, {main_q -> main_q - main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Variables:
0.00/0.18	main_q, main_y
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.000681s
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.001751s
0.00/0.18	[61849 : 61856]
0.00/0.18	[61849 : 61857]
0.00/0.18	Successful child: 61856
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, 1 <= main_q, {main_q -> main_q - 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, 1 <= main_q, {main_q -> main_q - 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:main_q <= 0 - Process 2
0.00/0.18	* Exit transition: <l0, l2, 0 <= main_q /\ main_q = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.18	* Postcondition  : main_q <= 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.000537s
0.00/0.18	> Postcondition is not implied!
0.00/0.18	
0.00/0.18	LOG: RETURN check - Elapsed time: 0.000634s
0.00/0.18	INVARIANTS: 
0.00/0.18	2: 
0.00/0.18	Quasi-INVARIANTS to narrow Graph: 
0.00/0.18	2: main_q <= 0 , 
0.00/0.18	Narrowing transition: 
0.00/0.18	<l2, l2, 1 <= main_q, {main_q -> main_q - 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, 1 <= main_q, {main_q -> main_q - main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Variables:
0.00/0.18	main_q, main_y
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.000679s
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.001734s
0.00/0.18	[61849 : 61861]
0.00/0.18	[61849 : 61862]
0.00/0.18	Successful child: 61861
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_q <= main_y /\ 1 <= main_q, {main_q -> main_q - 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_q <= main_y /\ 1 <= main_q, {main_q -> main_q - main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Ranking function: main_q
0.00/0.18	New Graphs: 
0.00/0.18	
0.00/0.18	LOG: CALL check - Post:main_q <= main_y - Process 3
0.00/0.18	* Exit transition: <l0, l2, 1 <= main_q /\ main_q = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.18	* Postcondition  : main_q <= 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.000507s
0.00/0.18	> Postcondition is not implied!
0.00/0.18	
0.00/0.18	LOG: RETURN check - Elapsed time: 0.000609s
0.00/0.18	INVARIANTS: 
0.00/0.18	2: 
0.00/0.18	Quasi-INVARIANTS to narrow Graph: 
0.00/0.18	2: main_q <= main_y , 
0.00/0.18	Narrowing transition: 
0.00/0.18	<l2, l2, 1 <= main_q, {main_q -> main_q - 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, 1 <= main_q /\ 1 + main_y <= main_q, {main_q -> main_q - main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Variables:
0.00/0.18	main_q, main_y
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.000578s
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.002096s
0.00/0.18	[61849 : 61866]
0.00/0.18	[61849 : 61867]
0.00/0.18	Successful child: 61866
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, 0 <= main_y /\ 1 <= main_q /\ 1 + main_y <= main_q, {main_q -> main_q - 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, 0 <= main_y /\ 1 <= main_q /\ 1 + main_y <= main_q, {main_q -> main_q - main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Ranking function: main_q - main_y
0.00/0.18	New Graphs: 
0.00/0.18	
0.00/0.18	LOG: CALL check - Post:0 <= main_y - Process 4
0.00/0.18	* Exit transition: <l0, l2, 1 <= main_q /\ 1 + main_y <= main_q /\ main_q = undef3 /\ main_y = undef4, {all remain the same}>
0.00/0.18	* Postcondition  : 0 <= 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.000595s
0.00/0.18	> Postcondition is not implied!
0.00/0.18	
0.00/0.18	LOG: RETURN check - Elapsed time: 0.000701s
0.00/0.18	INVARIANTS: 
0.00/0.18	2: 
0.00/0.18	Quasi-INVARIANTS to narrow Graph: 
0.00/0.18	2: 0 <= main_y , 
0.00/0.18	Narrowing transition: 
0.00/0.18	<l2, l2, 1 <= main_q /\ 1 + main_y <= main_q, {main_q -> main_q - 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, 1 <= main_q /\ 1 + main_y <= main_q /\ 1 + main_y <= 0, {main_q -> main_q - main_y, main_y -> 1 + main_y, rest remain the same}>
0.00/0.18	Variables:
0.00/0.18	main_q, main_y
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.000866s
0.00/0.18	Ranking function: -1 - main_y
0.00/0.18	New Graphs: 
0.00/0.18	Proving termination of subgraph 2
0.00/0.18	Analyzing SCC {l6}...
0.00/0.18	No cycles found.
0.00/0.18	
0.00/0.18	Program Terminates
0.00/0.18	EOF