47.48/25.00	NO
47.48/25.00	
47.48/25.01	Solver Timeout: 4
47.48/25.01	Global Timeout: 300
47.48/25.01	Maximum number of concurrent processes: 900
47.48/25.01	*******************************************************************************************
47.48/25.01	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
47.48/25.01	*******************************************************************************************
47.48/25.01	
47.48/25.01	
47.48/25.01	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
47.48/25.01	
47.48/25.01	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
47.48/25.01	+                                                                  +
47.48/25.01	Init Location: 0
47.48/25.01	Transitions:
47.48/25.01	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
47.48/25.01	<l1, l2, (main_y >= 5)>
47.48/25.01	<l1, l7, not((main_y >= 5))>
47.48/25.01	<l2, l3, true>
47.48/25.01	<l3, l6, not((main_x >= 0))>
47.48/25.01	<l3, l4, (main_x >= 0)>
47.48/25.01	<l4, l5, true, seq{main_y -> (main_y - 1)}>
47.48/25.01	<l5, l3, true>
47.48/25.01	<l6, l7, true>
47.48/25.01	<l7, l8, true, seq{main__func_return_ -> 0}>
47.48/25.01	
47.48/25.01	Fresh variables:
47.48/25.01	
47.48/25.01	Undef variables:
47.48/25.01	
47.48/25.01	Abstraction variables:
47.48/25.01	
47.48/25.01	Exit nodes:
47.48/25.01	
47.48/25.01	Accepting locations:
47.48/25.01	
47.48/25.01	Asserts:
47.48/25.01	
47.48/25.01	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
47.48/25.01	       
47.48/25.01	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
47.48/25.01	       
47.48/25.01	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
47.48/25.01	
47.48/25.01	Init Location: 0
47.48/25.01	Transitions:
47.48/25.01	<l0, l9, true, seq{main__func_return_ -> 0}>
47.48/25.01	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
47.48/25.01	<l10, l11, true, seq{main_x -> varCall_1}>
47.48/25.01	<l11, l12, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
47.48/25.01	<l12, l1, true, seq{main_y -> varCall_2}>
47.48/25.01	<l1, l2, (main_y >= 5)>
47.48/25.01	<l1, l7, not((main_y >= 5))>
47.48/25.01	<l2, l3, true>
47.48/25.01	<l3, l4, (main_x >= 0)>
47.48/25.01	<l3, l6, not((main_x >= 0))>
47.48/25.01	<l4, l5, true, seq{main_y -> (main_y - 1)}>
47.48/25.01	<l5, l3, true>
47.48/25.01	<l6, l7, true>
47.48/25.01	<l7, l8, true, seq{main__func_return_ -> 0}>
47.48/25.01	
47.48/25.01	Fresh variables:
47.48/25.01	
47.48/25.01	Undef variables:
47.48/25.01	
47.48/25.01	Abstraction variables:
47.48/25.01	
47.48/25.01	Exit nodes:
47.48/25.01	8, 
47.48/25.01	Accepting locations:
47.48/25.01	
47.48/25.01	Asserts:
47.48/25.01	
47.48/25.01	+                                                                  +
47.48/25.01	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
47.48/25.01	
47.48/25.01	
47.48/25.01	Function Return and Parameters Information [2 functions]:
47.48/25.01	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
47.48/25.01	        __VERIFIER_nondet_int__func_return_      [function result] : int
47.48/25.01	    function name: main [1 return + 0 parameters]        demangled: main
47.48/25.01	        main__func_return_      [function result] : int
47.48/25.01	
47.48/25.01	
47.48/25.01	AST Ident Scanner Information [4 idents]:
47.48/25.01	__VERIFIER_nondet_int | function | [integer, ()] | <line: 10, col: 1> | <line: 15, col: 6> <line: 16, col: 6>
47.48/25.01	main | function | [integer, ()] | <line: 12, col: 1>
47.48/25.01	x | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 18, col: 13>
47.48/25.01	y | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 17, col: 6> <line: 19, col: 7> <line: 19, col: 11>
47.48/25.01	
47.48/25.01	Main function: main
47.48/25.01	Preprocessed LLVMGraph
47.48/25.01	Init Location: 0
47.48/25.01	Transitions:
47.48/25.01	<l0, l3, (main_x = undef3) /\ (main_y = undef4) /\ (undef4 >= 5)>
47.48/25.01	<l0, l8, (main_x = undef3) /\ (main_y = undef4) /\ not((undef4 >= 5))>
47.48/25.01	<l3, l3, (main_x >= 0), par{main_y -> (main_y - 1)}>
47.48/25.01	<l3, l8, not((main_x >= 0))>
47.48/25.01	
47.48/25.01	Fresh variables:
47.48/25.01	undef3, undef4, 
47.48/25.01	
47.48/25.01	Undef variables:
47.48/25.01	undef3, undef4, 
47.48/25.01	
47.48/25.01	Abstraction variables:
47.48/25.01	
47.48/25.01	Exit nodes:
47.48/25.01	8, 
47.48/25.01	Accepting locations:
47.48/25.01	
47.48/25.01	Asserts:
47.48/25.01	
47.48/25.01	*************************************************************
47.48/25.01	*******************************************************************************************
47.48/25.01	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
47.48/25.01	*******************************************************************************************
47.48/25.01	
47.48/25.01	Init Location: 0
47.48/25.01	Graph 0:
47.48/25.01	Transitions:
47.48/25.01	Variables:
47.48/25.01	
47.48/25.01	Graph 1:
47.48/25.01	Transitions:
47.48/25.01	<l3, l3, 0 <= main_x, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	Variables:
47.48/25.01	main_x, main_y
47.48/25.01	
47.48/25.01	Graph 2:
47.48/25.01	Transitions:
47.48/25.01	Variables:
47.48/25.01	
47.48/25.01	Precedence: 
47.48/25.01	Graph 0
47.48/25.01	
47.48/25.01	Graph 1
47.48/25.01	<l0, l3, 5 <= undef4 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
47.48/25.01	
47.48/25.01	Graph 2
47.48/25.01	<l0, l8, undef4 <= 4 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
47.48/25.01	<l3, l8, 1 + main_x <= 0, {all remain the same}>
47.48/25.01	
47.48/25.01	Map Locations to Subgraph:
47.48/25.01	( 0 , 0 )
47.48/25.01	( 3 , 1 )
47.48/25.01	( 8 , 2 )
47.48/25.01	
47.48/25.01	*******************************************************************************************
47.48/25.01	********************************    CHECKING ASSERTIONS    ********************************
47.48/25.01	*******************************************************************************************
47.48/25.01	
47.48/25.01	Proving termination of subgraph 0
47.48/25.01	Proving termination of subgraph 1
47.48/25.01	Checking unfeasibility...
47.48/25.01	Time used: 0.001833
47.48/25.01	
47.48/25.01	Checking conditional termination of SCC {l3}...
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.000821s
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.001368s
47.48/25.01	[60323 : 60325]
47.48/25.01	[60323 : 60326]
47.48/25.01	Successful child: 60325
47.48/25.01	[ Invariant Graph ]
47.48/25.01	Strengthening and disabling transitions...
47.48/25.01	
47.48/25.01	LOG: CALL solverLinear in Graph for feasibility
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear in Graph for feasibility
47.48/25.01	It's unfeasible. Removing transition: 
47.48/25.01	<l3, l3, 0 <= main_x, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	[ Termination Graph ]
47.48/25.01	Strengthening and disabling transitions...
47.48/25.01	> It's unfeasible. Removing transition: 
47.48/25.01	<l3, l3, 0 <= main_x, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	New Graphs: 
47.48/25.01	
47.48/25.01	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
47.48/25.01	* Exit transition: <l0, l3, 5 <= undef4 /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
47.48/25.01	* Postcondition  : 1 + main_x <= 0
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.000530s
47.48/25.01	> Postcondition is not implied!
47.48/25.01	
47.48/25.01	LOG: RETURN check - Elapsed time: 0.000636s
47.48/25.01	INVARIANTS: 
47.48/25.01	3: 
47.48/25.01	Quasi-INVARIANTS to narrow Graph: 
47.48/25.01	3: 1 + main_x <= 0 , 
47.48/25.01	Narrowing transition: 
47.48/25.01	<l3, l3, 0 <= main_x, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	
47.48/25.01	LOG: Narrow transition size 1
47.48/25.01	invGraph after Narrowing: 
47.48/25.01	Transitions:
47.48/25.01	<l3, l3, 0 <= main_x, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	Variables:
47.48/25.01	main_x, main_y
47.48/25.01	Checking conditional termination of SCC {l3}...
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.000809s
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.001509s
47.48/25.01	[60323 : 60330]
47.48/25.01	[60323 : 60331]
47.48/25.01	Solving with 1 template(s).
47.48/25.01	
47.48/25.01	LOG: CALL solveNonLinearGetFirstSolution
47.48/25.01	
47.48/25.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007086s
47.48/25.01	Time used: 0.006779
47.48/25.01	Improving Solution with cost 1 ...
47.48/25.01	
47.48/25.01	LOG: CALL solveNonLinearGetNextSolution
47.48/25.01	
47.48/25.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001414s
47.48/25.01	Time used: 1.00135
47.48/25.01	
47.48/25.01	LOG: SAT solveNonLinear - Elapsed time: 1.008500s
47.48/25.01	Cost: 1; Total time: 1.00813
47.48/25.01	Termination implied by a set of invariant(s):
47.48/25.01	Invariant at l3: 0 <= main_x
47.48/25.01	[ Invariant Graph ]
47.48/25.01	Strengthening and disabling transitions...
47.48/25.01	
47.48/25.01	LOG: CALL solverLinear in Graph for feasibility
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear in Graph for feasibility
47.48/25.01	Strengthening transition (result): 
47.48/25.01	<l3, l3, 0 <= main_x, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	[ Termination Graph ]
47.48/25.01	Strengthening and disabling transitions...
47.48/25.01	
47.48/25.01	LOG: CALL solverLinear in Graph for feasibility
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear in Graph for feasibility
47.48/25.01	Strengthening transition (result): 
47.48/25.01	<l3, l3, 0 <= main_x, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	Quasi-ranking function: 50000 + main_y
47.48/25.01	New Graphs: 
47.48/25.01	Transitions:
47.48/25.01	<l3, l3, 0 <= main_x /\ 50001 + main_y <= 0, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	Variables:
47.48/25.01	main_x, main_y
47.48/25.01	Checking conditional termination of SCC {l3}...
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.000524s
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.001807s
47.48/25.01	[60323 : 60335]
47.48/25.01	[60323 : 60336]
47.48/25.01	Solving with 1 template(s).
47.48/25.01	
47.48/25.01	LOG: CALL solveNonLinearGetFirstSolution
47.48/25.01	
47.48/25.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007660s
47.48/25.01	Time used: 0.007059
47.48/25.01	Improving Solution with cost 1 ...
47.48/25.01	
47.48/25.01	LOG: CALL solveNonLinearGetNextSolution
47.48/25.01	
47.48/25.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000565s
47.48/25.01	Time used: 1.00038
47.48/25.01	
47.48/25.01	LOG: SAT solveNonLinear - Elapsed time: 1.008225s
47.48/25.01	Cost: 1; Total time: 1.00744
47.48/25.01	Quasi-ranking function: 50000 + main_x + main_y
47.48/25.01	New Graphs: 
47.48/25.01	Transitions:
47.48/25.01	<l3, l3, 0 <= main_x /\ 50001 + main_x + main_y <= 0 /\ 50001 + main_y <= 0, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	Variables:
47.48/25.01	main_x, main_y
47.48/25.01	Checking conditional termination of SCC {l3}...
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.000630s
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.002345s
47.48/25.01	[60323 : 60341]
47.48/25.01	[60323 : 60342]
47.48/25.01	Solving with 1 template(s).
47.48/25.01	
47.48/25.01	LOG: CALL solveNonLinearGetFirstSolution
47.48/25.01	
47.48/25.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008622s
47.48/25.01	Time used: 0.007852
47.48/25.01	Improving Solution with cost 1 ...
47.48/25.01	
47.48/25.01	LOG: CALL solveNonLinearGetNextSolution
47.48/25.01	
47.48/25.01	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.014655s
47.48/25.01	Time used: 1.0146
47.48/25.01	
47.48/25.01	LOG: SAT solveNonLinear - Elapsed time: 1.023277s
47.48/25.01	Cost: 1; Total time: 1.02245
47.48/25.01	Quasi-ranking function: 50000 - main_x + main_y
47.48/25.01	New Graphs: 
47.48/25.01	Transitions:
47.48/25.01	<l3, l3, 0 <= main_x /\ 50001 + main_x + main_y <= 0 /\ 50001 + main_y <= main_x /\ 50001 + main_y <= 0, {main_y -> -1 + main_y, rest remain the same}>
47.48/25.01	Variables:
47.48/25.01	main_x, main_y
47.48/25.01	Checking conditional termination of SCC {l3}...
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.000706s
47.48/25.01	
47.48/25.01	LOG: CALL solveLinear
47.48/25.01	
47.48/25.01	LOG: RETURN solveLinear - Elapsed time: 0.002612s
47.48/25.01	[60323 : 60346]
47.48/25.01	[60323 : 60347]
47.48/25.01	Solving with 1 template(s).
47.48/25.01	
47.48/25.01	LOG: CALL solveNonLinearGetFirstSolution
47.48/25.01	
47.48/25.01	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.166866s
47.48/25.01	Time used: 4.16532
47.48/25.01	
47.48/25.01	[60323 : 60351]
47.48/25.01	[60323 : 60355]
47.48/25.01	Successful child: 60351
47.48/25.01	
47.48/25.01	Program does NOT terminate
47.48/25.01	EOF