0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	Maximum number of concurrent processes: 900
0.00/0.06	*******************************************************************************************
0.00/0.06	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	
0.00/0.06	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.06	
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	+                                                                  +
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l1, true, seq{main__func_return_ -> 0, main_k -> ¿functionCall(__VERIFIER_nondet_int), main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l1, l2, (main_k >= 1)>
0.00/0.06	<l1, l13, not((main_k >= 1))>
0.00/0.06	<l2, l3, true, seq{main_i -> 0}>
0.00/0.06	<l3, l4, true>
0.00/0.06	<l4, l12, not((main_i < main_n))>
0.00/0.06	<l4, l5, (main_i < main_n)>
0.00/0.06	<l5, l6, true, seq{main_j -> 0}>
0.00/0.06	<l6, l7, true>
0.00/0.06	<l7, l10, not((main_j <= main_i))>
0.00/0.06	<l7, l8, (main_j <= main_i)>
0.00/0.06	<l8, l9, true, seq{main_j -> (main_j + main_k)}>
0.00/0.06	<l9, l7, true>
0.00/0.06	<l10, l11, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l11, l4, true>
0.00/0.06	<l12, l13, true>
0.00/0.06	<l13, l14, true, seq{main__func_return_ -> 0}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l15, true, seq{main__func_return_ -> 0}>
0.00/0.06	<l15, l16, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l16, l17, true, seq{main_k -> varCall_1}>
0.00/0.06	<l17, l18, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l18, l19, true, seq{main_i -> varCall_2}>
0.00/0.06	<l19, l20, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l20, l21, true, seq{main_j -> varCall_3}>
0.00/0.07	<l21, l22, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.07	<l22, l1, true, seq{main_n -> varCall_4}>
0.00/0.07	<l1, l2, (main_k >= 1)>
0.00/0.07	<l1, l13, not((main_k >= 1))>
0.00/0.07	<l2, l3, true, seq{main_i -> 0}>
0.00/0.07	<l3, l4, true>
0.00/0.07	<l4, l5, (main_i < main_n)>
0.00/0.07	<l4, l12, not((main_i < main_n))>
0.00/0.07	<l5, l6, true, seq{main_j -> 0}>
0.00/0.07	<l6, l7, true>
0.00/0.07	<l7, l8, (main_j <= main_i)>
0.00/0.07	<l7, l10, not((main_j <= main_i))>
0.00/0.07	<l8, l9, true, seq{main_j -> (main_j + main_k)}>
0.00/0.07	<l9, l7, true>
0.00/0.07	<l10, l11, true, seq{main_i -> (main_i + 1)}>
0.00/0.07	<l11, l4, true>
0.00/0.07	<l12, l13, true>
0.00/0.07	<l13, l14, true, seq{main__func_return_ -> 0}>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	14, 
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	+                                                                  +
0.00/0.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.07	
0.00/0.07	
0.00/0.07	Function Return and Parameters Information [2 functions]:
0.00/0.07	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.07	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.07	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.07	        main__func_return_      [function result] : int
0.00/0.07	
0.00/0.07	
0.00/0.07	AST Ident Scanner Information [6 idents]:
0.00/0.07	__VERIFIER_nondet_int | function | [integer, ()] | <line: 12, col: 1> | <line: 16, col: 6> <line: 17, col: 9> <line: 18, col: 9> <line: 19, col: 9>
0.00/0.07	main | function | [integer, ()] | <line: 14, col: 1>
0.00/0.07	k | local variable | integer | <line: 15, col: 5> | <line: 16, col: 2> <line: 20, col: 6> <line: 25, col: 13>
0.00/0.07	i | local variable | integer | <line: 15, col: 5> | <line: 17, col: 5> <line: 21, col: 3> <line: 22, col: 10> <line: 24, col: 16> <line: 27, col: 4> <line: 27, col: 8>
0.00/0.07	j | local variable | integer | <line: 15, col: 5> | <line: 18, col: 5> <line: 23, col: 4> <line: 24, col: 11> <line: 25, col: 5> <line: 25, col: 9>
0.00/0.07	n | local variable | integer | <line: 15, col: 5> | <line: 19, col: 5> <line: 22, col: 14>
0.00/0.07	
0.00/0.07	Main function: main
0.00/0.07	Preprocessed LLVMGraph
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l7, (main_k = undef5) /\ (main_n = undef8) /\ (undef5 >= 1) /\ (0 < undef8), par{main_i -> 0, main_j -> 0}>
0.00/0.07	<l0, l14, (main_k = undef5) /\ (main_n = undef8) /\ (undef5 >= 1) /\ not((0 < undef8)), par{main_i -> 0, main_j -> undef7}>
0.00/0.07	<l0, l14, (main_k = undef5) /\ (main_n = undef8) /\ not((undef5 >= 1)), par{main_i -> undef6, main_j -> undef7}>
0.00/0.07	<l7, l7, (main_j <= main_i), par{main_j -> (main_j + main_k)}>
0.00/0.07	<l7, l7, not((main_j <= main_i)) /\ ((main_i + 1) < main_n), par{main_i -> (main_i + 1), main_j -> 0}>
0.00/0.07	<l7, l14, not((main_j <= main_i)) /\ not(((main_i + 1) < main_n)), par{main_i -> (main_i + 1)}>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	undef5, undef6, undef7, undef8, 
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	undef5, undef6, undef7, undef8, 
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	14, 
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	*************************************************************
0.00/0.07	*******************************************************************************************
0.00/0.07	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Init Location: 0
0.00/0.07	Graph 0:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Graph 1:
0.00/0.07	Transitions:
0.00/0.07	<l7, l7, main_j <= main_i, {main_j -> main_k + main_j, rest remain the same}>
0.00/0.07	<l7, l7, 1 + main_i <= main_j /\ 2 + main_i <= main_n, {main_i -> 1 + main_i, main_j -> 0, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	main_k, main_i, main_j, main_n
0.00/0.07	
0.00/0.07	Graph 2:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Precedence: 
0.00/0.07	Graph 0
0.00/0.07	
0.00/0.07	Graph 1
0.00/0.07	<l0, l7, 1 <= undef5 /\ 1 <= undef8 /\ main_k = undef5 /\ main_n = undef8, {main_i -> 0, main_j -> 0, rest remain the same}>
0.00/0.07	
0.00/0.07	Graph 2
0.00/0.07	<l0, l14, undef8 <= 0 /\ 1 <= undef5 /\ main_k = undef5 /\ main_n = undef8, {main_i -> 0, main_j -> undef7, rest remain the same}>
0.00/0.07	<l0, l14, undef5 <= 0 /\ main_k = undef5 /\ main_n = undef8, {main_i -> undef6, main_j -> undef7, rest remain the same}>
0.00/0.07	<l7, l14, 1 + main_i <= main_j /\ main_n <= 1 + main_i, {main_i -> 1 + main_i, rest remain the same}>
0.00/0.07	
0.00/0.07	Map Locations to Subgraph:
0.00/0.07	( 0 , 0 )
0.00/0.07	( 7 , 1 )
0.00/0.07	( 14 , 2 )
0.00/0.07	
0.00/0.07	*******************************************************************************************
0.00/0.07	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Proving termination of subgraph 0
0.00/0.07	Proving termination of subgraph 1
0.00/0.07	Checking unfeasibility...
0.00/0.07	Time used: 0.008215
0.00/0.07	
0.00/0.07	Checking conditional termination of SCC {l7}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.001645s
0.00/0.07	Ranking function: -1 - 2*main_i + 2*main_n
0.00/0.07	New Graphs: 
0.00/0.07	Transitions:
0.00/0.07	<l7, l7, main_j <= main_i, {main_j -> main_k + main_j, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	main_k, main_i, main_j
0.00/0.07	Checking conditional termination of SCC {l7}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.000791s
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.001777s
0.00/0.07	[61119 : 61121]
0.00/0.07	[61119 : 61122]
0.00/0.07	Successful child: 61121
0.00/0.07	[ Invariant Graph ]
0.00/0.07	Strengthening and disabling transitions...
0.00/0.07	
0.00/0.07	LOG: CALL solverLinear in Graph for feasibility
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.07	Strengthening transition (result): 
0.00/0.07	<l7, l7, main_j <= main_i /\ 1 <= main_k, {main_j -> main_k + main_j, rest remain the same}>
0.00/0.07	
0.00/0.07	LOG: CALL solverLinear in Graph for feasibility
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.07	Strengthening transition (result): 
0.00/0.07	<l7, l7, 1 <= main_k /\ 1 + main_i <= main_j /\ 2 + main_i <= main_n, {main_i -> 1 + main_i, main_j -> 0, rest remain the same}>
0.00/0.07	[ Termination Graph ]
0.00/0.07	Strengthening and disabling transitions...
0.00/0.07	
0.00/0.07	LOG: CALL solverLinear in Graph for feasibility
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.07	Strengthening transition (result): 
0.00/0.07	<l7, l7, main_j <= main_i /\ 1 <= main_k, {main_j -> main_k + main_j, rest remain the same}>
0.00/0.07	Ranking function: main_i - main_j
0.00/0.07	New Graphs: 
0.00/0.07	INVARIANTS: 
0.00/0.07	7: 1 <= main_k , 
0.00/0.07	Quasi-INVARIANTS to narrow Graph: 
0.00/0.07	7: 
0.00/0.07	Proving termination of subgraph 2
0.00/0.07	Analyzing SCC {l14}...
0.00/0.07	No cycles found.
0.00/0.07	
0.00/0.07	Program Terminates
0.00/0.07	EOF