18.63/8.36	NO
18.63/8.36	
18.63/8.36	Solver Timeout: 4
18.63/8.36	Global Timeout: 300
18.63/8.36	Maximum number of concurrent processes: 900
18.63/8.36	*******************************************************************************************
18.63/8.36	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
18.63/8.36	*******************************************************************************************
18.63/8.36	
18.63/8.36	
18.63/8.36	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
18.63/8.36	
18.63/8.36	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.63/8.36	+                                                                  +
18.63/8.36	Init Location: 0
18.63/8.36	Transitions:
18.63/8.36	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
18.63/8.36	<l1, l2, true>
18.63/8.36	<l2, l5, not((main_i < 0))>
18.63/8.36	<l2, l3, (main_i < 0)>
18.63/8.36	<l3, l4, true, seq{main_i -> (main_i - 1)}>
18.63/8.36	<l4, l2, true>
18.63/8.36	<l5, l6, true, seq{main__func_return_ -> 0}>
18.63/8.36	
18.63/8.36	Fresh variables:
18.63/8.36	
18.63/8.36	Undef variables:
18.63/8.36	
18.63/8.36	Abstraction variables:
18.63/8.36	
18.63/8.36	Exit nodes:
18.63/8.36	
18.63/8.36	Accepting locations:
18.63/8.36	
18.63/8.36	Asserts:
18.63/8.36	
18.63/8.36	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
18.63/8.36	       
18.63/8.36	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
18.63/8.36	       
18.63/8.36	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
18.63/8.36	
18.63/8.36	Init Location: 0
18.63/8.36	Transitions:
18.63/8.36	<l0, l7, true, seq{main__func_return_ -> 0}>
18.63/8.36	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
18.63/8.36	<l8, l1, true, seq{main_i -> varCall_1}>
18.63/8.36	<l1, l2, true>
18.63/8.36	<l2, l3, (main_i < 0)>
18.63/8.36	<l2, l5, not((main_i < 0))>
18.63/8.36	<l3, l4, true, seq{main_i -> (main_i - 1)}>
18.63/8.36	<l4, l2, true>
18.63/8.36	<l5, l6, true, seq{main__func_return_ -> 0}>
18.63/8.36	
18.63/8.36	Fresh variables:
18.63/8.36	
18.63/8.36	Undef variables:
18.63/8.36	
18.63/8.36	Abstraction variables:
18.63/8.36	
18.63/8.36	Exit nodes:
18.63/8.36	6, 
18.63/8.36	Accepting locations:
18.63/8.36	
18.63/8.36	Asserts:
18.63/8.36	
18.63/8.36	+                                                                  +
18.63/8.36	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.63/8.36	
18.63/8.36	
18.63/8.36	Function Return and Parameters Information [2 functions]:
18.63/8.36	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
18.63/8.36	        __VERIFIER_nondet_int__func_return_      [function result] : int
18.63/8.36	    function name: main [1 return + 0 parameters]        demangled: main
18.63/8.36	        main__func_return_      [function result] : int
18.63/8.36	
18.63/8.36	
18.63/8.36	AST Ident Scanner Information [3 idents]:
18.63/8.36	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
18.63/8.36	main | function | [integer, ()] | <line: 5, col: 1>
18.63/8.36	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 9> <line: 10, col: 13>
18.63/8.36	
18.63/8.36	Main function: main
18.63/8.36	Preprocessed LLVMGraph
18.63/8.36	Init Location: 0
18.63/8.36	Transitions:
18.63/8.36	<l0, l2, (main_i = undef2)>
18.63/8.36	<l2, l2, (main_i < 0), par{main_i -> (main_i - 1)}>
18.63/8.36	<l2, l6, not((main_i < 0))>
18.63/8.36	
18.63/8.36	Fresh variables:
18.63/8.36	undef2, 
18.63/8.36	
18.63/8.36	Undef variables:
18.63/8.36	undef2, 
18.63/8.36	
18.63/8.36	Abstraction variables:
18.63/8.36	
18.63/8.36	Exit nodes:
18.63/8.36	6, 
18.63/8.36	Accepting locations:
18.63/8.36	
18.63/8.36	Asserts:
18.63/8.36	
18.63/8.36	*************************************************************
18.63/8.36	*******************************************************************************************
18.63/8.36	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
18.63/8.36	*******************************************************************************************
18.63/8.36	
18.63/8.36	Init Location: 0
18.63/8.36	Graph 0:
18.63/8.36	Transitions:
18.63/8.36	Variables:
18.63/8.36	
18.63/8.36	Graph 1:
18.63/8.36	Transitions:
18.63/8.36	<l2, l2, 1 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.63/8.36	Variables:
18.63/8.36	main_i
18.63/8.36	
18.63/8.36	Graph 2:
18.63/8.36	Transitions:
18.63/8.36	Variables:
18.63/8.36	
18.63/8.36	Precedence: 
18.63/8.36	Graph 0
18.63/8.36	
18.63/8.36	Graph 1
18.63/8.36	<l0, l2, main_i = undef2, {all remain the same}>
18.63/8.36	
18.63/8.36	Graph 2
18.63/8.36	<l2, l6, 0 <= main_i, {all remain the same}>
18.63/8.36	
18.63/8.36	Map Locations to Subgraph:
18.63/8.36	( 0 , 0 )
18.63/8.36	( 2 , 1 )
18.63/8.36	( 6 , 2 )
18.63/8.36	
18.63/8.36	*******************************************************************************************
18.63/8.36	********************************    CHECKING ASSERTIONS    ********************************
18.63/8.36	*******************************************************************************************
18.63/8.36	
18.63/8.36	Proving termination of subgraph 0
18.63/8.36	Proving termination of subgraph 1
18.63/8.36	Checking unfeasibility...
18.63/8.36	Time used: 0.001397
18.63/8.36	
18.63/8.36	Checking conditional termination of SCC {l2}...
18.63/8.36	
18.63/8.36	LOG: CALL solveLinear
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear - Elapsed time: 0.000418s
18.63/8.36	
18.63/8.36	LOG: CALL solveLinear
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear - Elapsed time: 0.001117s
18.63/8.36	[6997 : 6999]
18.63/8.36	[6997 : 7000]
18.63/8.36	Successful child: 6999
18.63/8.36	[ Invariant Graph ]
18.63/8.36	Strengthening and disabling transitions...
18.63/8.36	
18.63/8.36	LOG: CALL solverLinear in Graph for feasibility
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear in Graph for feasibility
18.63/8.36	It's unfeasible. Removing transition: 
18.63/8.36	<l2, l2, 1 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.63/8.36	[ Termination Graph ]
18.63/8.36	Strengthening and disabling transitions...
18.63/8.36	
18.63/8.36	LOG: CALL solverLinear in Graph for feasibility
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear in Graph for feasibility
18.63/8.36	It's unfeasible. Removing transition: 
18.63/8.36	<l2, l2, 1 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.63/8.36	New Graphs: 
18.63/8.36	
18.63/8.36	LOG: CALL check - Post:0 <= main_i - Process 1
18.63/8.36	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
18.63/8.36	* Postcondition  : 0 <= main_i
18.63/8.36	
18.63/8.36	LOG: CALL solveLinear
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear - Elapsed time: 0.000363s
18.63/8.36	> Postcondition is not implied!
18.63/8.36	
18.63/8.36	LOG: RETURN check - Elapsed time: 0.000451s
18.63/8.36	INVARIANTS: 
18.63/8.36	2: 
18.63/8.36	Quasi-INVARIANTS to narrow Graph: 
18.63/8.36	2: 0 <= main_i , 
18.63/8.36	Narrowing transition: 
18.63/8.36	<l2, l2, 1 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.63/8.36	
18.63/8.36	LOG: Narrow transition size 1
18.63/8.36	invGraph after Narrowing: 
18.63/8.36	Transitions:
18.63/8.36	<l2, l2, 1 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.63/8.36	Variables:
18.63/8.36	main_i
18.63/8.36	Checking conditional termination of SCC {l2}...
18.63/8.36	
18.63/8.36	LOG: CALL solveLinear
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear - Elapsed time: 0.000422s
18.63/8.36	
18.63/8.36	LOG: CALL solveLinear
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear - Elapsed time: 0.001225s
18.63/8.36	[6997 : 7004]
18.63/8.36	[6997 : 7005]
18.63/8.36	Solving with 1 template(s).
18.63/8.36	
18.63/8.36	LOG: CALL solveNonLinearGetFirstSolution
18.63/8.36	
18.63/8.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005046s
18.63/8.36	Time used: 0.00473
18.63/8.36	Improving Solution with cost 1 ...
18.63/8.36	
18.63/8.36	LOG: CALL solveNonLinearGetNextSolution
18.63/8.36	
18.63/8.36	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014081s
18.63/8.36	Time used: 0.014077
18.63/8.36	
18.63/8.36	LOG: SAT solveNonLinear - Elapsed time: 0.019127s
18.63/8.36	Cost: 1; Total time: 0.018807
18.63/8.36	Termination implied by a set of invariant(s):
18.63/8.36	Invariant at l2: 1 + main_i <= 0
18.63/8.36	[ Invariant Graph ]
18.63/8.36	Strengthening and disabling transitions...
18.63/8.36	
18.63/8.36	LOG: CALL solverLinear in Graph for feasibility
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear in Graph for feasibility
18.63/8.36	Strengthening transition (result): 
18.63/8.36	<l2, l2, 1 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.63/8.36	[ Termination Graph ]
18.63/8.36	Strengthening and disabling transitions...
18.63/8.36	
18.63/8.36	LOG: CALL solverLinear in Graph for feasibility
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear in Graph for feasibility
18.63/8.36	Strengthening transition (result): 
18.63/8.36	<l2, l2, 1 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.63/8.36	Quasi-ranking function: 50000 + main_i
18.63/8.36	New Graphs: 
18.63/8.36	Transitions:
18.63/8.36	<l2, l2, 50001 + main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.63/8.36	Variables:
18.63/8.36	main_i
18.63/8.36	Checking conditional termination of SCC {l2}...
18.63/8.36	
18.63/8.36	LOG: CALL solveLinear
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear - Elapsed time: 0.000388s
18.63/8.36	
18.63/8.36	LOG: CALL solveLinear
18.63/8.36	
18.63/8.36	LOG: RETURN solveLinear - Elapsed time: 0.001166s
18.63/8.36	[6997 : 7009]
18.63/8.36	[6997 : 7010]
18.63/8.36	Solving with 1 template(s).
18.63/8.36	
18.63/8.36	LOG: CALL solveNonLinearGetFirstSolution
18.63/8.36	
18.63/8.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004567s
18.63/8.36	Time used: 0.004267
18.63/8.36	
18.63/8.36	[6997 : 7014]
18.63/8.36	[6997 : 7018]
18.63/8.36	Successful child: 7014
18.63/8.36	
18.63/8.36	Program does NOT terminate
18.63/8.36	EOF