18.85/8.50	NO
18.85/8.50	
18.85/8.50	Solver Timeout: 4
18.85/8.50	Global Timeout: 300
18.85/8.50	Maximum number of concurrent processes: 900
18.85/8.50	*******************************************************************************************
18.85/8.50	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
18.85/8.50	*******************************************************************************************
18.85/8.50	
18.85/8.50	
18.85/8.50	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
18.85/8.50	
18.85/8.50	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.85/8.50	+                                                                  +
18.85/8.50	Init Location: 0
18.85/8.50	Transitions:
18.85/8.50	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
18.85/8.50	<l1, l2, true>
18.85/8.50	<l2, l6, (main_i = 1)>
18.85/8.50	<l2, l3, not((main_i = 1))>
18.85/8.50	<l3, l6, (main_i = 0)>
18.85/8.50	<l3, l4, not((main_i = 0))>
18.85/8.50	<l4, l5, true, seq{main_i -> (main_i - 2)}>
18.85/8.50	<l5, l2, true>
18.85/8.50	<l6, l7, true, seq{main__func_return_ -> 0}>
18.85/8.50	
18.85/8.50	Fresh variables:
18.85/8.50	
18.85/8.50	Undef variables:
18.85/8.50	
18.85/8.50	Abstraction variables:
18.85/8.50	
18.85/8.50	Exit nodes:
18.85/8.50	
18.85/8.50	Accepting locations:
18.85/8.50	
18.85/8.50	Asserts:
18.85/8.50	
18.85/8.50	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
18.85/8.50	       
18.85/8.50	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
18.85/8.50	       
18.85/8.50	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
18.85/8.50	
18.85/8.50	Init Location: 0
18.85/8.50	Transitions:
18.85/8.50	<l0, l8, true, seq{main__func_return_ -> 0}>
18.85/8.50	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
18.85/8.50	<l9, l1, true, seq{main_i -> varCall_1}>
18.85/8.50	<l1, l2, true>
18.85/8.50	<l2, l6, (main_i = 1)>
18.85/8.50	<l2, l3, not((main_i = 1))>
18.85/8.50	<l3, l6, (main_i = 0)>
18.85/8.50	<l3, l4, not((main_i = 0))>
18.85/8.50	<l4, l5, true, seq{main_i -> (main_i - 2)}>
18.85/8.50	<l5, l2, true>
18.85/8.50	<l6, l7, true, seq{main__func_return_ -> 0}>
18.85/8.50	
18.85/8.50	Fresh variables:
18.85/8.50	
18.85/8.50	Undef variables:
18.85/8.50	
18.85/8.50	Abstraction variables:
18.85/8.50	
18.85/8.50	Exit nodes:
18.85/8.50	7, 
18.85/8.50	Accepting locations:
18.85/8.50	
18.85/8.50	Asserts:
18.85/8.50	
18.85/8.50	+                                                                  +
18.85/8.50	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.85/8.50	
18.85/8.50	
18.85/8.50	Function Return and Parameters Information [2 functions]:
18.85/8.50	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
18.85/8.50	        __VERIFIER_nondet_int__func_return_      [function result] : int
18.85/8.50	    function name: main [1 return + 0 parameters]        demangled: main
18.85/8.50	        main__func_return_      [function result] : int
18.85/8.50	
18.85/8.50	
18.85/8.50	AST Ident Scanner Information [4 idents]:
18.85/8.50	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 8, col: 9>
18.85/8.50	main | function | [integer, ()] | <line: 5, col: 1>
18.85/8.50	i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 10, col: 12> <line: 10, col: 22> <line: 11, col: 9> <line: 11, col: 13>
18.85/8.50	b | local variable | integer | <line: 7, col: 5>
18.85/8.50	
18.85/8.50	Main function: main
18.85/8.50	Preprocessed LLVMGraph
18.85/8.50	Init Location: 0
18.85/8.50	Transitions:
18.85/8.50	<l0, l2, (main_i = undef2)>
18.85/8.50	<l2, l7, (main_i = 1)>
18.85/8.50	<l2, l7, (main_i < 1) /\ (main_i = 0)>
18.85/8.50	<l2, l2, (main_i < 1) /\ (main_i < 0), par{main_i -> (main_i - 2)}>
18.85/8.50	<l2, l2, (main_i > 1) /\ (main_i > 0), par{main_i -> (main_i - 2)}>
18.85/8.50	
18.85/8.50	Fresh variables:
18.85/8.50	undef2, 
18.85/8.50	
18.85/8.50	Undef variables:
18.85/8.50	undef2, 
18.85/8.50	
18.85/8.50	Abstraction variables:
18.85/8.50	
18.85/8.50	Exit nodes:
18.85/8.50	7, 
18.85/8.50	Accepting locations:
18.85/8.50	
18.85/8.50	Asserts:
18.85/8.50	
18.85/8.50	*************************************************************
18.85/8.50	*******************************************************************************************
18.85/8.50	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
18.85/8.50	*******************************************************************************************
18.85/8.50	
18.85/8.50	Init Location: 0
18.85/8.50	Graph 0:
18.85/8.50	Transitions:
18.85/8.50	Variables:
18.85/8.50	
18.85/8.50	Graph 1:
18.85/8.50	Transitions:
18.85/8.50	<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	<l2, l2, 2 <= main_i, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	Variables:
18.85/8.50	main_i
18.85/8.50	
18.85/8.50	Graph 2:
18.85/8.50	Transitions:
18.85/8.50	Variables:
18.85/8.50	
18.85/8.50	Precedence: 
18.85/8.50	Graph 0
18.85/8.50	
18.85/8.50	Graph 1
18.85/8.50	<l0, l2, main_i = undef2, {all remain the same}>
18.85/8.50	
18.85/8.50	Graph 2
18.85/8.50	<l2, l7, main_i = 1, {all remain the same}>
18.85/8.50	<l2, l7, main_i = 0, {all remain the same}>
18.85/8.50	
18.85/8.50	Map Locations to Subgraph:
18.85/8.50	( 0 , 0 )
18.85/8.50	( 2 , 1 )
18.85/8.50	( 7 , 2 )
18.85/8.50	
18.85/8.50	*******************************************************************************************
18.85/8.50	********************************    CHECKING ASSERTIONS    ********************************
18.85/8.50	*******************************************************************************************
18.85/8.50	
18.85/8.50	Proving termination of subgraph 0
18.85/8.50	Proving termination of subgraph 1
18.85/8.50	Checking unfeasibility...
18.85/8.50	Time used: 0.002336
18.85/8.50	
18.85/8.50	Checking conditional termination of SCC {l2}...
18.85/8.50	
18.85/8.50	LOG: CALL solveLinear
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear - Elapsed time: 0.000810s
18.85/8.50	Ranking function: -1 + (1 / 2)*main_i
18.85/8.50	New Graphs: 
18.85/8.50	Transitions:
18.85/8.50	<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	Variables:
18.85/8.50	main_i
18.85/8.50	Checking conditional termination of SCC {l2}...
18.85/8.50	
18.85/8.50	LOG: CALL solveLinear
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear - Elapsed time: 0.000374s
18.85/8.50	
18.85/8.50	LOG: CALL solveLinear
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear - Elapsed time: 0.001134s
18.85/8.50	[5235 : 5237]
18.85/8.50	[5235 : 5238]
18.85/8.50	Successful child: 5237
18.85/8.50	[ Invariant Graph ]
18.85/8.50	Strengthening and disabling transitions...
18.85/8.50	
18.85/8.50	LOG: CALL solverLinear in Graph for feasibility
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear in Graph for feasibility
18.85/8.50	It's unfeasible. Removing transition: 
18.85/8.50	<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	
18.85/8.50	LOG: CALL solverLinear in Graph for feasibility
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear in Graph for feasibility
18.85/8.50	Strengthening transition (result): 
18.85/8.50	<l2, l2, 2 <= main_i, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	[ Termination Graph ]
18.85/8.50	Strengthening and disabling transitions...
18.85/8.50	> It's unfeasible. Removing transition: 
18.85/8.50	<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	New Graphs: 
18.85/8.50	
18.85/8.50	LOG: CALL check - Post:0 <= main_i - Process 1
18.85/8.50	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
18.85/8.50	* Postcondition  : 0 <= main_i
18.85/8.50	
18.85/8.50	LOG: CALL solveLinear
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear - Elapsed time: 0.000387s
18.85/8.50	> Postcondition is not implied!
18.85/8.50	
18.85/8.50	LOG: RETURN check - Elapsed time: 0.000467s
18.85/8.50	INVARIANTS: 
18.85/8.50	2: 
18.85/8.50	Quasi-INVARIANTS to narrow Graph: 
18.85/8.50	2: 0 <= main_i , 
18.85/8.50	Narrowing transition: 
18.85/8.50	<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	
18.85/8.50	LOG: Narrow transition size 1
18.85/8.50	It's unfeasible. Removing transition: 
18.85/8.50	<l2, l2, 2 <= main_i, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	invGraph after Narrowing: 
18.85/8.50	Transitions:
18.85/8.50	<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	Variables:
18.85/8.50	main_i
18.85/8.50	Checking conditional termination of SCC {l2}...
18.85/8.50	
18.85/8.50	LOG: CALL solveLinear
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear - Elapsed time: 0.000429s
18.85/8.50	
18.85/8.50	LOG: CALL solveLinear
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear - Elapsed time: 0.001233s
18.85/8.50	[5235 : 5242]
18.85/8.50	[5235 : 5243]
18.85/8.50	Solving with 1 template(s).
18.85/8.50	
18.85/8.50	LOG: CALL solveNonLinearGetFirstSolution
18.85/8.50	
18.85/8.50	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005901s
18.85/8.50	Time used: 0.005613
18.85/8.50	Improving Solution with cost 1 ...
18.85/8.50	
18.85/8.50	LOG: CALL solveNonLinearGetNextSolution
18.85/8.50	
18.85/8.50	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016255s
18.85/8.50	Time used: 0.016251
18.85/8.50	
18.85/8.50	LOG: SAT solveNonLinear - Elapsed time: 0.022156s
18.85/8.50	Cost: 1; Total time: 0.021864
18.85/8.50	Termination implied by a set of invariant(s):
18.85/8.50	Invariant at l2: main_i <= 1
18.85/8.50	[ Invariant Graph ]
18.85/8.50	Strengthening and disabling transitions...
18.85/8.50	
18.85/8.50	LOG: CALL solverLinear in Graph for feasibility
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear in Graph for feasibility
18.85/8.50	Strengthening transition (result): 
18.85/8.50	<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	[ Termination Graph ]
18.85/8.50	Strengthening and disabling transitions...
18.85/8.50	
18.85/8.50	LOG: CALL solverLinear in Graph for feasibility
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear in Graph for feasibility
18.85/8.50	Strengthening transition (result): 
18.85/8.50	<l2, l2, 1 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	Quasi-ranking function: 50000 + main_i
18.85/8.50	New Graphs: 
18.85/8.50	Transitions:
18.85/8.50	<l2, l2, 50001 + main_i <= 0, {main_i -> -2 + main_i, rest remain the same}>
18.85/8.50	Variables:
18.85/8.50	main_i
18.85/8.50	Checking conditional termination of SCC {l2}...
18.85/8.50	
18.85/8.50	LOG: CALL solveLinear
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear - Elapsed time: 0.000396s
18.85/8.50	
18.85/8.50	LOG: CALL solveLinear
18.85/8.50	
18.85/8.50	LOG: RETURN solveLinear - Elapsed time: 0.001207s
18.85/8.50	[5235 : 5247]
18.85/8.50	[5235 : 5248]
18.85/8.50	Solving with 1 template(s).
18.85/8.50	
18.85/8.50	LOG: CALL solveNonLinearGetFirstSolution
18.85/8.50	
18.85/8.50	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005735s
18.85/8.50	Time used: 0.005437
18.85/8.50	
18.85/8.50	[5235 : 5252]
18.85/8.50	[5235 : 5256]
18.85/8.50	Successful child: 5252
18.85/8.50	
18.85/8.50	Program does NOT terminate
18.85/8.50	EOF