23.67/13.50	NO
23.67/13.50	
23.67/13.50	Solver Timeout: 4
23.67/13.50	Global Timeout: 300
23.67/13.50	Maximum number of concurrent processes: 900
23.67/13.50	*******************************************************************************************
23.67/13.50	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
23.67/13.50	*******************************************************************************************
23.67/13.50	
23.67/13.50	
23.67/13.50	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
23.67/13.50	
23.67/13.50	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
23.67/13.50	+                                                                  +
23.67/13.50	Init Location: 0
23.67/13.50	Transitions:
23.67/13.50	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
23.67/13.50	<l1, l2, true>
23.67/13.50	<l2, l10, not((main_i < 10))>
23.67/13.50	<l2, l3, (main_i < 10)>
23.67/13.50	<l3, l4, true, seq{main_j -> main_i}>
23.67/13.50	<l4, l5, true>
23.67/13.50	<l5, l8, not((main_j > 0))>
23.67/13.50	<l5, l6, (main_j > 0)>
23.67/13.50	<l6, l7, true, seq{main_j -> (main_j + 1)}>
23.67/13.50	<l7, l5, true>
23.67/13.50	<l8, l9, true, seq{main_i -> (main_i + 1)}>
23.67/13.50	<l9, l2, true>
23.67/13.50	<l10, l11, true, seq{main__func_return_ -> 0}>
23.67/13.50	
23.67/13.50	Fresh variables:
23.67/13.50	
23.67/13.50	Undef variables:
23.67/13.50	
23.67/13.50	Abstraction variables:
23.67/13.50	
23.67/13.50	Exit nodes:
23.67/13.50	
23.67/13.50	Accepting locations:
23.67/13.50	
23.67/13.50	Asserts:
23.67/13.50	
23.67/13.50	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
23.67/13.50	       
23.67/13.50	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
23.67/13.50	       
23.67/13.50	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
23.67/13.50	
23.67/13.50	Init Location: 0
23.67/13.50	Transitions:
23.67/13.50	<l0, l12, true, seq{main__func_return_ -> 0}>
23.67/13.50	<l12, l13, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
23.67/13.50	<l13, l1, true, seq{main_i -> varCall_1}>
23.67/13.50	<l1, l2, true>
23.67/13.50	<l2, l3, (main_i < 10)>
23.67/13.50	<l2, l10, not((main_i < 10))>
23.67/13.50	<l3, l4, true, seq{main_j -> main_i}>
23.67/13.50	<l4, l5, true>
23.67/13.50	<l5, l6, (main_j > 0)>
23.67/13.50	<l5, l8, not((main_j > 0))>
23.67/13.50	<l6, l7, true, seq{main_j -> (main_j + 1)}>
23.67/13.50	<l7, l5, true>
23.67/13.50	<l8, l9, true, seq{main_i -> (main_i + 1)}>
23.67/13.50	<l9, l2, true>
23.67/13.50	<l10, l11, true, seq{main__func_return_ -> 0}>
23.67/13.50	
23.67/13.50	Fresh variables:
23.67/13.50	
23.67/13.50	Undef variables:
23.67/13.50	
23.67/13.50	Abstraction variables:
23.67/13.50	
23.67/13.50	Exit nodes:
23.67/13.50	11, 
23.67/13.50	Accepting locations:
23.67/13.50	
23.67/13.50	Asserts:
23.67/13.50	
23.67/13.50	+                                                                  +
23.67/13.51	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
23.67/13.51	
23.67/13.51	
23.67/13.51	Function Return and Parameters Information [2 functions]:
23.67/13.51	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
23.67/13.51	        __VERIFIER_nondet_int__func_return_      [function result] : int
23.67/13.51	    function name: main [1 return + 0 parameters]        demangled: main
23.67/13.51	        main__func_return_      [function result] : int
23.67/13.51	
23.67/13.51	
23.67/13.51	AST Ident Scanner Information [4 idents]:
23.67/13.51	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 8, col: 9>
23.67/13.51	main | function | [integer, ()] | <line: 5, col: 1>
23.67/13.51	i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 10, col: 12> <line: 11, col: 13> <line: 15, col: 9> <line: 15, col: 13>
23.67/13.51	j | local variable | integer | <line: 7, col: 5> | <line: 11, col: 9> <line: 12, col: 16> <line: 13, col: 13> <line: 13, col: 17>
23.67/13.51	
23.67/13.51	Main function: main
23.67/13.51	Preprocessed LLVMGraph
23.67/13.51	Init Location: 0
23.67/13.51	Transitions:
23.67/13.51	<l0, l5, (main_i = undef2) /\ (undef2 < 10), par{main_j -> undef2}>
23.67/13.51	<l0, l11, (main_i = undef2) /\ not((undef2 < 10))>
23.67/13.51	<l5, l5, (main_j > 0), par{main_j -> (main_j + 1)}>
23.67/13.51	<l5, l5, not((main_j > 0)) /\ ((main_i + 1) < 10), par{main_i -> (main_i + 1), main_j -> (main_i + 1)}>
23.67/13.51	<l5, l11, not((main_j > 0)) /\ not(((main_i + 1) < 10)), par{main_i -> (main_i + 1)}>
23.67/13.51	
23.67/13.51	Fresh variables:
23.67/13.51	undef2, 
23.67/13.51	
23.67/13.51	Undef variables:
23.67/13.51	undef2, 
23.67/13.51	
23.67/13.51	Abstraction variables:
23.67/13.51	
23.67/13.51	Exit nodes:
23.67/13.51	11, 
23.67/13.51	Accepting locations:
23.67/13.51	
23.67/13.51	Asserts:
23.67/13.51	
23.67/13.51	*************************************************************
23.67/13.51	*******************************************************************************************
23.67/13.51	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
23.67/13.51	*******************************************************************************************
23.67/13.51	
23.67/13.51	Init Location: 0
23.67/13.51	Graph 0:
23.67/13.51	Transitions:
23.67/13.51	Variables:
23.67/13.51	
23.67/13.51	Graph 1:
23.67/13.51	Transitions:
23.67/13.51	<l5, l5, 1 <= main_j, {main_j -> 1 + main_j, rest remain the same}>
23.67/13.51	<l5, l5, main_j <= 0 /\ main_i <= 8, {main_i -> 1 + main_i, main_j -> 1 + main_i, rest remain the same}>
23.67/13.51	Variables:
23.67/13.51	main_j, main_i
23.67/13.51	
23.67/13.51	Graph 2:
23.67/13.51	Transitions:
23.67/13.51	Variables:
23.67/13.51	
23.67/13.51	Precedence: 
23.67/13.51	Graph 0
23.67/13.51	
23.67/13.51	Graph 1
23.67/13.51	<l0, l5, undef2 <= 9 /\ main_i = undef2, {main_j -> undef2, rest remain the same}>
23.67/13.51	
23.67/13.51	Graph 2
23.67/13.51	<l0, l11, 10 <= undef2 /\ main_i = undef2, {all remain the same}>
23.67/13.51	<l5, l11, main_j <= 0 /\ 9 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
23.67/13.51	
23.67/13.51	Map Locations to Subgraph:
23.67/13.51	( 0 , 0 )
23.67/13.51	( 5 , 1 )
23.67/13.51	( 11 , 2 )
23.67/13.51	
23.67/13.51	*******************************************************************************************
23.67/13.51	********************************    CHECKING ASSERTIONS    ********************************
23.67/13.51	*******************************************************************************************
23.67/13.51	
23.67/13.51	Proving termination of subgraph 0
23.67/13.51	Proving termination of subgraph 1
23.67/13.51	Checking unfeasibility...
23.67/13.51	Time used: 0.003379
23.67/13.51	
23.67/13.51	Checking conditional termination of SCC {l5}...
23.67/13.51	
23.67/13.51	LOG: CALL solveLinear
23.67/13.51	
23.67/13.51	LOG: RETURN solveLinear - Elapsed time: 0.001253s
23.67/13.51	Ranking function: 8 - main_i
23.67/13.51	New Graphs: 
23.67/13.51	Transitions:
23.67/13.51	<l5, l5, 1 <= main_j, {main_j -> 1 + main_j, rest remain the same}>
23.67/13.51	Variables:
23.67/13.51	main_j
23.67/13.51	Checking conditional termination of SCC {l5}...
23.67/13.51	
23.67/13.51	LOG: CALL solveLinear
23.67/13.51	
23.67/13.51	LOG: RETURN solveLinear - Elapsed time: 0.000511s
23.67/13.51	
23.67/13.51	LOG: CALL solveLinear
23.67/13.51	
23.67/13.51	LOG: RETURN solveLinear - Elapsed time: 0.001275s
23.67/13.51	[36983 : 36985]
23.67/13.51	[36983 : 36986]
23.67/13.51	Solving with 1 template(s).
23.67/13.51	
23.67/13.51	LOG: CALL solveNonLinearGetFirstSolution
23.67/13.51	
23.67/13.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010191s
23.67/13.51	Time used: 0.00986
23.67/13.51	Improving Solution with cost 1 ...
23.67/13.51	
23.67/13.51	LOG: CALL solveNonLinearGetNextSolution
23.67/13.51	
23.67/13.51	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000851s
23.67/13.51	Time used: 1.00076
23.67/13.51	
23.67/13.51	LOG: SAT solveNonLinear - Elapsed time: 1.011042s
23.67/13.51	Cost: 1; Total time: 1.01062
23.67/13.51	Termination implied by a set of invariant(s):
23.67/13.51	Invariant at l5: main_i <= main_j
23.67/13.51	[ Invariant Graph ]
23.67/13.51	Strengthening and disabling transitions...
23.67/13.51	
23.67/13.51	LOG: CALL solverLinear in Graph for feasibility
23.67/13.51	
23.67/13.51	LOG: RETURN solveLinear in Graph for feasibility
23.67/13.51	Strengthening transition (result): 
23.67/13.51	<l5, l5, main_i <= main_j /\ 1 <= main_j, {main_j -> 1 + main_j, rest remain the same}>
23.67/13.51	
23.67/13.51	LOG: CALL solverLinear in Graph for feasibility
23.67/13.51	
23.67/13.51	LOG: RETURN solveLinear in Graph for feasibility
23.67/13.51	Strengthening transition (result): 
23.67/13.51	<l5, l5, main_i <= main_j /\ main_j <= 0 /\ main_i <= 8, {main_i -> 1 + main_i, main_j -> 1 + main_i, rest remain the same}>
23.67/13.51	[ Termination Graph ]
23.67/13.51	Strengthening and disabling transitions...
23.67/13.51	
23.67/13.51	LOG: CALL solverLinear in Graph for feasibility
23.67/13.51	
23.67/13.51	LOG: RETURN solveLinear in Graph for feasibility
23.67/13.51	Strengthening transition (result): 
23.67/13.51	<l5, l5, main_i <= main_j /\ 1 <= main_j, {main_j -> 1 + main_j, rest remain the same}>
23.67/13.51	Quasi-ranking function: 50000 - main_j
23.67/13.51	New Graphs: 
23.67/13.51	Transitions:
23.67/13.51	<l5, l5, main_i <= main_j /\ 50001 <= main_j, {main_j -> 1 + main_j, rest remain the same}>
23.67/13.51	Variables:
23.67/13.51	main_j
23.67/13.51	Checking conditional termination of SCC {l5}...
23.67/13.51	
23.67/13.51	LOG: CALL solveLinear
23.67/13.51	
23.67/13.51	LOG: RETURN solveLinear - Elapsed time: 0.000509s
23.67/13.51	
23.67/13.51	LOG: CALL solveLinear
23.67/13.51	
23.67/13.51	LOG: RETURN solveLinear - Elapsed time: 0.001780s
23.67/13.51	[36983 : 36990]
23.67/13.51	[36983 : 36991]
23.67/13.51	Solving with 1 template(s).
23.67/13.51	
23.67/13.51	LOG: CALL solveNonLinearGetFirstSolution
23.67/13.51	
23.67/13.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101950s
23.67/13.51	Time used: 4.10127
23.67/13.51	Termination failed. Trying to show unreachability...
23.67/13.51	Proving unreachability of entry: <l0, l5, undef2 <= 9 /\ main_i = undef2, {main_j -> undef2, rest remain the same}>
23.67/13.51	
23.67/13.51	LOG: CALL check - Post:1 <= 0 - Process 1
23.67/13.51	* Exit transition: <l0, l5, undef2 <= 9 /\ main_i = undef2, {main_j -> undef2, rest remain the same}>
23.67/13.51	* Postcondition  : 1 <= 0
23.67/13.51	
23.67/13.51	LOG: CALL solveLinear
23.67/13.51	
23.67/13.51	LOG: RETURN solveLinear - Elapsed time: 0.007392s
23.67/13.51	> Postcondition is not implied!
23.67/13.51	
23.67/13.51	LOG: RETURN check - Elapsed time: 0.007513s
23.67/13.51	Cannot prove unreachability
23.67/13.51	
23.67/13.51	[36983 : 37161]
23.67/13.51	[36983 : 37165]
23.67/13.51	Successful child: 37161
23.67/13.51	
23.67/13.51	Program does NOT terminate
23.67/13.51	EOF