25.56/9.48	NO
25.56/9.48	
25.56/9.48	Solver Timeout: 4
25.56/9.48	Global Timeout: 300
25.56/9.48	Maximum number of concurrent processes: 900
25.56/9.48	*******************************************************************************************
25.56/9.48	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
25.56/9.48	*******************************************************************************************
25.56/9.48	
25.56/9.48	
25.56/9.48	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
25.56/9.48	
25.56/9.48	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
25.56/9.48	+                                                                  +
25.56/9.48	Init Location: 0
25.56/9.48	Transitions:
25.56/9.48	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
25.56/9.48	<l1, l2, true>
25.56/9.48	<l2, l9, (main_i = 0)>
25.56/9.48	<l2, l3, not((main_i = 0))>
25.56/9.48	<l3, l4, (main_i < 0)>
25.56/9.48	<l3, l6, not((main_i < 0))>
25.56/9.48	<l4, l5, true, seq{main_i -> (main_i - 1), main_i -> (main_i * ~(1))}>
25.56/9.48	<l5, l8, true>
25.56/9.48	<l6, l7, true, seq{main_i -> (main_i + 1), main_i -> (main_i * ~(1))}>
25.56/9.48	<l7, l8, true>
25.56/9.48	<l8, l2, true>
25.56/9.48	<l9, l10, true, seq{main__func_return_ -> 0}>
25.56/9.48	
25.56/9.48	Fresh variables:
25.56/9.48	
25.56/9.48	Undef variables:
25.56/9.48	
25.56/9.48	Abstraction variables:
25.56/9.48	
25.56/9.48	Exit nodes:
25.56/9.48	
25.56/9.48	Accepting locations:
25.56/9.48	
25.56/9.48	Asserts:
25.56/9.48	
25.56/9.48	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
25.56/9.48	       
25.56/9.48	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
25.56/9.48	       
25.56/9.48	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
25.56/9.48	
25.56/9.48	Init Location: 0
25.56/9.48	Transitions:
25.56/9.48	<l0, l11, true, seq{main__func_return_ -> 0}>
25.56/9.48	<l11, l12, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
25.56/9.48	<l12, l1, true, seq{main_i -> varCall_1}>
25.56/9.48	<l1, l2, true>
25.56/9.48	<l2, l9, (main_i = 0)>
25.56/9.48	<l2, l3, not((main_i = 0))>
25.56/9.48	<l3, l4, (main_i < 0)>
25.56/9.48	<l3, l6, not((main_i < 0))>
25.56/9.48	<l4, l5, true, seq{main_i -> (main_i - 1), main_i -> (main_i * ~(1))}>
25.56/9.48	<l5, l8, true>
25.56/9.48	<l6, l7, true, seq{main_i -> (main_i + 1), main_i -> (main_i * ~(1))}>
25.56/9.48	<l7, l8, true>
25.56/9.48	<l8, l2, true>
25.56/9.48	<l9, l10, true, seq{main__func_return_ -> 0}>
25.56/9.48	
25.56/9.48	Fresh variables:
25.56/9.48	
25.56/9.48	Undef variables:
25.56/9.48	
25.56/9.48	Abstraction variables:
25.56/9.48	
25.56/9.48	Exit nodes:
25.56/9.48	10, 
25.56/9.48	Accepting locations:
25.56/9.48	
25.56/9.48	Asserts:
25.56/9.48	
25.56/9.48	+                                                                  +
25.56/9.48	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
25.56/9.48	
25.56/9.48	
25.56/9.48	Function Return and Parameters Information [2 functions]:
25.56/9.48	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
25.56/9.48	        __VERIFIER_nondet_int__func_return_      [function result] : int
25.56/9.48	    function name: main [1 return + 0 parameters]        demangled: main
25.56/9.48	        main__func_return_      [function result] : int
25.56/9.48	
25.56/9.48	
25.56/9.48	AST Ident Scanner Information [3 idents]:
25.56/9.48	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
25.56/9.48	main | function | [integer, ()] | <line: 5, col: 1>
25.56/9.48	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 13> <line: 11, col: 13> <line: 11, col: 17> <line: 12, col: 13> <line: 12, col: 17> <line: 14, col: 13> <line: 14, col: 17> <line: 15, col: 13> <line: 15, col: 17>
25.56/9.48	
25.56/9.48	Main function: main
25.56/9.48	Preprocessed LLVMGraph
25.56/9.48	Init Location: 0
25.56/9.48	Transitions:
25.56/9.48	<l0, l2, (main_i = undef2)>
25.56/9.48	<l2, l10, (main_i = 0)>
25.56/9.48	<l2, l2, (main_i < 0) /\ (main_i < 0), par{main_i -> ((main_i - 1) * ~(1))}>
25.56/9.48	<l2, l2, (main_i > 0) /\ not((main_i < 0)), par{main_i -> ((main_i + 1) * ~(1))}>
25.56/9.48	
25.56/9.48	Fresh variables:
25.56/9.48	undef2, 
25.56/9.48	
25.56/9.48	Undef variables:
25.56/9.48	undef2, 
25.56/9.48	
25.56/9.48	Abstraction variables:
25.56/9.48	
25.56/9.48	Exit nodes:
25.56/9.48	10, 
25.56/9.48	Accepting locations:
25.56/9.48	
25.56/9.48	Asserts:
25.56/9.48	
25.56/9.48	*************************************************************
25.56/9.48	*******************************************************************************************
25.56/9.48	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
25.56/9.48	*******************************************************************************************
25.56/9.48	
25.56/9.48	Init Location: 0
25.56/9.48	Graph 0:
25.56/9.48	Transitions:
25.56/9.48	Variables:
25.56/9.48	
25.56/9.48	Graph 1:
25.56/9.48	Transitions:
25.56/9.48	<l2, l2, 1 + main_i <= 0, {main_i -> 1 - main_i, rest remain the same}>
25.56/9.48	<l2, l2, 1 <= main_i, {main_i -> -1 - main_i, rest remain the same}>
25.56/9.48	Variables:
25.56/9.48	main_i
25.56/9.48	
25.56/9.48	Graph 2:
25.56/9.48	Transitions:
25.56/9.48	Variables:
25.56/9.48	
25.56/9.48	Precedence: 
25.56/9.48	Graph 0
25.56/9.48	
25.56/9.48	Graph 1
25.56/9.48	<l0, l2, main_i = undef2, {all remain the same}>
25.56/9.48	
25.56/9.48	Graph 2
25.56/9.48	<l2, l10, main_i = 0, {all remain the same}>
25.56/9.48	
25.56/9.48	Map Locations to Subgraph:
25.56/9.48	( 0 , 0 )
25.56/9.48	( 2 , 1 )
25.56/9.48	( 10 , 2 )
25.56/9.48	
25.56/9.48	*******************************************************************************************
25.56/9.48	********************************    CHECKING ASSERTIONS    ********************************
25.56/9.48	*******************************************************************************************
25.56/9.48	
25.56/9.48	Proving termination of subgraph 0
25.56/9.48	Proving termination of subgraph 1
25.56/9.48	Checking unfeasibility...
25.56/9.48	Time used: 0.002384
25.56/9.48	
25.56/9.48	Checking conditional termination of SCC {l2}...
25.56/9.48	
25.56/9.48	LOG: CALL solveLinear
25.56/9.48	
25.56/9.48	LOG: RETURN solveLinear - Elapsed time: 0.000760s
25.56/9.48	
25.56/9.48	LOG: CALL solveLinear
25.56/9.48	
25.56/9.48	LOG: RETURN solveLinear - Elapsed time: 0.009260s
25.56/9.48	[62335 : 62337]
25.56/9.48	[62335 : 62338]
25.56/9.48	Successful child: 62337
25.56/9.48	[ Invariant Graph ]
25.56/9.48	Strengthening and disabling transitions...
25.56/9.48	
25.56/9.48	LOG: CALL solverLinear in Graph for feasibility
25.56/9.48	
25.56/9.48	LOG: RETURN solveLinear in Graph for feasibility
25.56/9.48	It's unfeasible. Removing transition: 
25.56/9.48	<l2, l2, 1 + main_i <= 0, {main_i -> 1 - main_i, rest remain the same}>
25.56/9.48	
25.56/9.48	LOG: CALL solverLinear in Graph for feasibility
25.56/9.48	
25.56/9.48	LOG: RETURN solveLinear in Graph for feasibility
25.56/9.48	It's unfeasible. Removing transition: 
25.56/9.48	<l2, l2, 1 <= main_i, {main_i -> -1 - main_i, rest remain the same}>
25.56/9.48	[ Termination Graph ]
25.56/9.48	Strengthening and disabling transitions...
25.56/9.48	
25.56/9.48	LOG: CALL solverLinear in Graph for feasibility
25.56/9.48	
25.56/9.48	LOG: RETURN solveLinear in Graph for feasibility
25.56/9.48	It's unfeasible. Removing transition: 
25.56/9.48	<l2, l2, 1 + main_i <= 0, {main_i -> 1 - main_i, rest remain the same}>
25.56/9.48	
25.56/9.48	LOG: CALL solverLinear in Graph for feasibility
25.56/9.48	
25.56/9.48	LOG: RETURN solveLinear in Graph for feasibility
25.56/9.48	It's unfeasible. Removing transition: 
25.56/9.48	<l2, l2, 1 <= main_i, {main_i -> -1 - main_i, rest remain the same}>
25.56/9.48	New Graphs: 
25.56/9.48	[62335 : 62343]
25.56/9.48	[62335 : 62344]
25.56/9.48	INVARIANTS: 
25.56/9.48	2: 
25.56/9.48	Quasi-INVARIANTS to narrow Graph: 
25.56/9.48	2: main_i <= 0 , 0 <= main_i , 
25.56/9.48	Narrowing transition: 
25.56/9.48	<l2, l2, 1 + main_i <= 0, {main_i -> 1 - main_i, rest remain the same}>
25.56/9.48	
25.56/9.48	LOG: Narrow transition size 2
25.56/9.48	Narrowing transition: 
25.56/9.48	<l2, l2, 1 <= main_i, {main_i -> -1 - main_i, rest remain the same}>
25.56/9.48	
25.56/9.48	LOG: Narrow transition size 2
25.56/9.48	invGraph after Narrowing: 
25.56/9.48	Transitions:
25.56/9.48	<l2, l2, 1 + main_i <= 0, {main_i -> 1 - main_i, rest remain the same}>
25.56/9.48	<l2, l2, 1 <= main_i, {main_i -> -1 - main_i, rest remain the same}>
25.56/9.48	Variables:
25.56/9.48	main_i
25.56/9.48	Checking conditional termination of SCC {l2}...
25.56/9.48	
25.56/9.48	LOG: CALL solveLinear
25.56/9.48	
25.56/9.48	LOG: RETURN solveLinear - Elapsed time: 0.000766s
25.56/9.48	
25.56/9.48	LOG: CALL solveLinear
25.56/9.48	
25.56/9.48	LOG: RETURN solveLinear - Elapsed time: 0.009433s
25.56/9.48	[62335 : 62345]
25.56/9.48	[62335 : 62346]
25.56/9.48	Solving with 1 template(s).
25.56/9.48	
25.56/9.48	LOG: CALL solveNonLinearGetFirstSolution
25.56/9.48	
25.56/9.48	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009362s
25.56/9.48	Time used: 0.008993
25.56/9.48	
25.56/9.48	[62335 : 62350]
25.56/9.48	[62335 : 62354]
25.56/9.48	Successful child: 62354
25.56/9.48	
25.56/9.48	Program does NOT terminate
25.56/9.48	EOF