10.19/5.46	NO
10.19/5.46	
10.19/5.47	Solver Timeout: 4
10.19/5.47	Global Timeout: 300
10.19/5.47	Maximum number of concurrent processes: 900
10.19/5.47	*******************************************************************************************
10.19/5.47	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
10.19/5.47	*******************************************************************************************
10.19/5.47	
10.19/5.47	
10.19/5.47	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
10.19/5.47	
10.19/5.47	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
10.19/5.47	+                                                                  +
10.19/5.47	Init Location: 0
10.19/5.47	Transitions:
10.19/5.47	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
10.19/5.47	<l1, l2, true>
10.19/5.47	<l2, l5, not((main_x > 0))>
10.19/5.47	<l2, l3, (main_x > 0)>
10.19/5.47	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (~(2) * main_y)}>
10.19/5.47	<l4, l2, true>
10.19/5.47	<l5, l6, true, seq{main__func_return_ -> 0}>
10.19/5.47	
10.19/5.47	Fresh variables:
10.19/5.47	
10.19/5.47	Undef variables:
10.19/5.47	
10.19/5.47	Abstraction variables:
10.19/5.47	
10.19/5.47	Exit nodes:
10.19/5.47	
10.19/5.47	Accepting locations:
10.19/5.47	
10.19/5.47	Asserts:
10.19/5.47	
10.19/5.47	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
10.19/5.47	       
10.19/5.47	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
10.19/5.47	       
10.19/5.47	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
10.19/5.47	
10.19/5.47	Init Location: 0
10.19/5.47	Transitions:
10.19/5.47	<l0, l7, true, seq{main__func_return_ -> 0}>
10.19/5.47	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
10.19/5.47	<l8, l9, true, seq{main_x -> varCall_1}>
10.19/5.47	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
10.19/5.47	<l10, l1, true, seq{main_y -> varCall_2}>
10.19/5.47	<l1, l2, true>
10.19/5.47	<l2, l3, (main_x > 0)>
10.19/5.47	<l2, l5, not((main_x > 0))>
10.19/5.47	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (~(2) * main_y)}>
10.19/5.47	<l4, l2, true>
10.19/5.47	<l5, l6, true, seq{main__func_return_ -> 0}>
10.19/5.47	
10.19/5.47	Fresh variables:
10.19/5.47	
10.19/5.47	Undef variables:
10.19/5.47	
10.19/5.47	Abstraction variables:
10.19/5.47	
10.19/5.47	Exit nodes:
10.19/5.47	6, 
10.19/5.47	Accepting locations:
10.19/5.47	
10.19/5.47	Asserts:
10.19/5.47	
10.19/5.47	+                                                                  +
10.19/5.47	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
10.19/5.47	
10.19/5.47	
10.19/5.47	Function Return and Parameters Information [2 functions]:
10.19/5.47	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
10.19/5.47	        __VERIFIER_nondet_int__func_return_      [function result] : int
10.19/5.47	    function name: main [1 return + 0 parameters]        demangled: main
10.19/5.47	        main__func_return_      [function result] : int
10.19/5.47	
10.19/5.47	
10.19/5.47	AST Ident Scanner Information [4 idents]:
10.19/5.47	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9>
10.19/5.47	main | function | [integer, ()] | <line: 22, col: 1>
10.19/5.47	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 27, col: 9> <line: 27, col: 13>
10.19/5.47	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 27, col: 17> <line: 28, col: 9> <line: 28, col: 16>
10.19/5.47	
10.19/5.47	Main function: main
10.19/5.47	Preprocessed LLVMGraph
10.19/5.47	Init Location: 0
10.19/5.47	Transitions:
10.19/5.47	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
10.19/5.47	<l2, l2, (main_x > 0), par{main_x -> (main_x + main_y), main_y -> (~(2) * main_y)}>
10.19/5.47	<l2, l6, not((main_x > 0))>
10.19/5.47	
10.19/5.47	Fresh variables:
10.19/5.47	undef3, undef4, 
10.19/5.47	
10.19/5.47	Undef variables:
10.19/5.47	undef3, undef4, 
10.19/5.47	
10.19/5.47	Abstraction variables:
10.19/5.47	
10.19/5.47	Exit nodes:
10.19/5.47	6, 
10.19/5.47	Accepting locations:
10.19/5.47	
10.19/5.47	Asserts:
10.19/5.47	
10.19/5.47	*************************************************************
10.19/5.47	*******************************************************************************************
10.19/5.47	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
10.19/5.47	*******************************************************************************************
10.19/5.47	
10.19/5.47	Init Location: 0
10.19/5.47	Graph 0:
10.19/5.47	Transitions:
10.19/5.47	Variables:
10.19/5.47	
10.19/5.47	Graph 1:
10.19/5.47	Transitions:
10.19/5.47	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
10.19/5.47	Variables:
10.19/5.47	main_x, main_y
10.19/5.47	
10.19/5.47	Graph 2:
10.19/5.47	Transitions:
10.19/5.47	Variables:
10.19/5.47	
10.19/5.47	Precedence: 
10.19/5.47	Graph 0
10.19/5.47	
10.19/5.47	Graph 1
10.19/5.47	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
10.19/5.47	
10.19/5.47	Graph 2
10.19/5.47	<l2, l6, main_x <= 0, {all remain the same}>
10.19/5.47	
10.19/5.47	Map Locations to Subgraph:
10.19/5.47	( 0 , 0 )
10.19/5.47	( 2 , 1 )
10.19/5.47	( 6 , 2 )
10.19/5.47	
10.19/5.47	*******************************************************************************************
10.19/5.47	********************************    CHECKING ASSERTIONS    ********************************
10.19/5.47	*******************************************************************************************
10.19/5.47	
10.19/5.47	Proving termination of subgraph 0
10.19/5.47	Proving termination of subgraph 1
10.19/5.47	Checking unfeasibility...
10.19/5.47	Time used: 0.002099
10.19/5.47	
10.19/5.47	Checking conditional termination of SCC {l2}...
10.19/5.47	
10.19/5.47	LOG: CALL solveLinear
10.19/5.47	
10.19/5.47	LOG: RETURN solveLinear - Elapsed time: 0.000629s
10.19/5.47	
10.19/5.47	LOG: CALL solveLinear
10.19/5.47	
10.19/5.47	LOG: RETURN solveLinear - Elapsed time: 0.001521s
10.19/5.47	[34512 : 34514]
10.19/5.47	[34512 : 34515]
10.19/5.47	Successful child: 34514
10.19/5.47	[ Invariant Graph ]
10.19/5.47	Strengthening and disabling transitions...
10.19/5.47	
10.19/5.47	LOG: CALL solverLinear in Graph for feasibility
10.19/5.47	
10.19/5.47	LOG: RETURN solveLinear in Graph for feasibility
10.19/5.47	It's unfeasible. Removing transition: 
10.19/5.47	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
10.19/5.47	[ Termination Graph ]
10.19/5.47	Strengthening and disabling transitions...
10.19/5.47	> It's unfeasible. Removing transition: 
10.19/5.47	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
10.19/5.47	New Graphs: 
10.19/5.47	
10.19/5.47	LOG: CALL check - Post:main_x <= 0 - Process 1
10.19/5.47	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
10.19/5.47	* Postcondition  : main_x <= 0
10.19/5.47	
10.19/5.47	LOG: CALL solveLinear
10.19/5.47	
10.19/5.47	LOG: RETURN solveLinear - Elapsed time: 0.000469s
10.19/5.47	> Postcondition is not implied!
10.19/5.47	
10.19/5.47	LOG: RETURN check - Elapsed time: 0.000560s
10.19/5.47	INVARIANTS: 
10.19/5.47	2: 
10.19/5.47	Quasi-INVARIANTS to narrow Graph: 
10.19/5.47	2: main_x <= 0 , 
10.19/5.47	Narrowing transition: 
10.19/5.47	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
10.19/5.47	
10.19/5.47	LOG: Narrow transition size 1
10.19/5.47	invGraph after Narrowing: 
10.19/5.47	Transitions:
10.19/5.47	<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> -2*main_y, rest remain the same}>
10.19/5.47	Variables:
10.19/5.47	main_x, main_y
10.19/5.47	Checking conditional termination of SCC {l2}...
10.19/5.47	
10.19/5.47	LOG: CALL solveLinear
10.19/5.47	
10.19/5.47	LOG: RETURN solveLinear - Elapsed time: 0.000614s
10.19/5.47	
10.19/5.47	LOG: CALL solveLinear
10.19/5.47	
10.19/5.47	LOG: RETURN solveLinear - Elapsed time: 0.001651s
10.19/5.47	[34512 : 34519]
10.19/5.47	[34512 : 34520]
10.19/5.47	Solving with 1 template(s).
10.19/5.47	
10.19/5.47	LOG: CALL solveNonLinearGetFirstSolution
10.19/5.47	
10.19/5.47	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007763s
10.19/5.47	Time used: 0.007514
10.19/5.47	
10.19/5.47	[34512 : 34524]
10.19/5.47	[34512 : 34528]
10.19/5.47	Successful child: 34524
10.19/5.47	
10.19/5.47	Program does NOT terminate
10.19/5.47	EOF