58.93/26.09	NO
58.93/26.09	
58.93/26.09	Solver Timeout: 4
58.93/26.09	Global Timeout: 300
58.93/26.09	Maximum number of concurrent processes: 900
58.93/26.09	*******************************************************************************************
58.93/26.09	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
58.93/26.09	*******************************************************************************************
58.93/26.09	
58.93/26.09	
58.93/26.09	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
58.93/26.09	
58.93/26.09	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
58.93/26.09	+                                                                  +
58.93/26.09	Init Location: 0
58.93/26.09	Transitions:
58.93/26.09	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int)}>
58.93/26.09	<l1, l2, true>
58.93/26.09	<l2, l5, (main_i = main_j)>
58.93/26.09	<l2, l3, not((main_i = main_j))>
58.93/26.09	<l3, l4, true, seq{main_i -> (main_i - 1), main_j -> (main_j + 1)}>
58.93/26.09	<l4, l2, true>
58.93/26.09	<l5, l6, true, seq{main__func_return_ -> 0}>
58.93/26.09	
58.93/26.09	Fresh variables:
58.93/26.09	
58.93/26.09	Undef variables:
58.93/26.09	
58.93/26.09	Abstraction variables:
58.93/26.09	
58.93/26.09	Exit nodes:
58.93/26.09	
58.93/26.09	Accepting locations:
58.93/26.09	
58.93/26.09	Asserts:
58.93/26.09	
58.93/26.09	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
58.93/26.09	       
58.93/26.09	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
58.93/26.09	       
58.93/26.09	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
58.93/26.09	
58.93/26.09	Init Location: 0
58.93/26.09	Transitions:
58.93/26.09	<l0, l7, true, seq{main__func_return_ -> 0}>
58.93/26.09	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
58.93/26.09	<l8, l9, true, seq{main_i -> varCall_1}>
58.93/26.09	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
58.93/26.09	<l10, l1, true, seq{main_j -> varCall_2}>
58.93/26.09	<l1, l2, true>
58.93/26.09	<l2, l5, (main_i = main_j)>
58.93/26.09	<l2, l3, not((main_i = main_j))>
58.93/26.09	<l3, l4, true, seq{main_i -> (main_i - 1), main_j -> (main_j + 1)}>
58.93/26.09	<l4, l2, true>
58.93/26.09	<l5, l6, true, seq{main__func_return_ -> 0}>
58.93/26.09	
58.93/26.09	Fresh variables:
58.93/26.09	
58.93/26.09	Undef variables:
58.93/26.09	
58.93/26.09	Abstraction variables:
58.93/26.09	
58.93/26.09	Exit nodes:
58.93/26.09	6, 
58.93/26.09	Accepting locations:
58.93/26.09	
58.93/26.09	Asserts:
58.93/26.09	
58.93/26.09	+                                                                  +
58.93/26.09	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
58.93/26.09	
58.93/26.09	
58.93/26.09	Function Return and Parameters Information [2 functions]:
58.93/26.09	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
58.93/26.09	        __VERIFIER_nondet_int__func_return_      [function result] : int
58.93/26.09	    function name: main [1 return + 0 parameters]        demangled: main
58.93/26.09	        main__func_return_      [function result] : int
58.93/26.09	
58.93/26.09	
58.93/26.09	AST Ident Scanner Information [4 idents]:
58.93/26.09	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 8, col: 9> <line: 9, col: 9>
58.93/26.09	main | function | [integer, ()] | <line: 5, col: 1>
58.93/26.09	i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 11, col: 12> <line: 12, col: 9> <line: 12, col: 13>
58.93/26.09	j | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 11, col: 17> <line: 13, col: 9> <line: 13, col: 13>
58.93/26.09	
58.93/26.09	Main function: main
58.93/26.09	Preprocessed LLVMGraph
58.93/26.09	Init Location: 0
58.93/26.09	Transitions:
58.93/26.09	<l0, l2, (main_i = undef3) /\ (main_j = undef4)>
58.93/26.09	<l2, l6, (main_i = main_j)>
58.93/26.09	<l2, l2, (main_i < main_j), par{main_i -> (main_i - 1), main_j -> (main_j + 1)}>
58.93/26.09	<l2, l2, (main_i > main_j), par{main_i -> (main_i - 1), main_j -> (main_j + 1)}>
58.93/26.09	
58.93/26.09	Fresh variables:
58.93/26.09	undef3, undef4, 
58.93/26.09	
58.93/26.09	Undef variables:
58.93/26.09	undef3, undef4, 
58.93/26.09	
58.93/26.09	Abstraction variables:
58.93/26.09	
58.93/26.09	Exit nodes:
58.93/26.09	6, 
58.93/26.09	Accepting locations:
58.93/26.09	
58.93/26.09	Asserts:
58.93/26.09	
58.93/26.09	*************************************************************
58.93/26.09	*******************************************************************************************
58.93/26.09	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
58.93/26.09	*******************************************************************************************
58.93/26.09	
58.93/26.09	Init Location: 0
58.93/26.09	Graph 0:
58.93/26.09	Transitions:
58.93/26.09	Variables:
58.93/26.09	
58.93/26.09	Graph 1:
58.93/26.09	Transitions:
58.93/26.09	<l2, l2, 1 + main_i <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	<l2, l2, 1 + main_j <= main_i, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	Variables:
58.93/26.09	main_i, main_j
58.93/26.09	
58.93/26.09	Graph 2:
58.93/26.09	Transitions:
58.93/26.09	Variables:
58.93/26.09	
58.93/26.09	Precedence: 
58.93/26.09	Graph 0
58.93/26.09	
58.93/26.09	Graph 1
58.93/26.09	<l0, l2, main_i = undef3 /\ main_j = undef4, {all remain the same}>
58.93/26.09	
58.93/26.09	Graph 2
58.93/26.09	<l2, l6, main_i = main_j, {all remain the same}>
58.93/26.09	
58.93/26.09	Map Locations to Subgraph:
58.93/26.09	( 0 , 0 )
58.93/26.09	( 2 , 1 )
58.93/26.09	( 6 , 2 )
58.93/26.09	
58.93/26.09	*******************************************************************************************
58.93/26.09	********************************    CHECKING ASSERTIONS    ********************************
58.93/26.09	*******************************************************************************************
58.93/26.09	
58.93/26.09	Proving termination of subgraph 0
58.93/26.09	Proving termination of subgraph 1
58.93/26.09	Checking unfeasibility...
58.93/26.09	Time used: 0.003155
58.93/26.09	
58.93/26.09	Checking conditional termination of SCC {l2}...
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.000962s
58.93/26.09	Ranking function: 1 + main_i - main_j
58.93/26.09	New Graphs: 
58.93/26.09	Transitions:
58.93/26.09	<l2, l2, 1 + main_i <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	Variables:
58.93/26.09	main_i, main_j
58.93/26.09	Checking conditional termination of SCC {l2}...
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.000445s
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.001555s
58.93/26.09	[17242 : 17244]
58.93/26.09	[17242 : 17245]
58.93/26.09	Successful child: 17244
58.93/26.09	[ Invariant Graph ]
58.93/26.09	Strengthening and disabling transitions...
58.93/26.09	
58.93/26.09	LOG: CALL solverLinear in Graph for feasibility
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear in Graph for feasibility
58.93/26.09	It's unfeasible. Removing transition: 
58.93/26.09	<l2, l2, 1 + main_i <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	
58.93/26.09	LOG: CALL solverLinear in Graph for feasibility
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear in Graph for feasibility
58.93/26.09	It's unfeasible. Removing transition: 
58.93/26.09	<l2, l2, 1 + main_j <= main_i, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	[ Termination Graph ]
58.93/26.09	Strengthening and disabling transitions...
58.93/26.09	
58.93/26.09	LOG: CALL solverLinear in Graph for feasibility
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear in Graph for feasibility
58.93/26.09	It's unfeasible. Removing transition: 
58.93/26.09	<l2, l2, 1 + main_i <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	New Graphs: 
58.93/26.09	[17242 : 17249]
58.93/26.09	[17242 : 17250]
58.93/26.09	INVARIANTS: 
58.93/26.09	2: 
58.93/26.09	Quasi-INVARIANTS to narrow Graph: 
58.93/26.09	2: main_i <= main_j , main_j <= main_i , 
58.93/26.09	Narrowing transition: 
58.93/26.09	<l2, l2, 1 + main_i <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	
58.93/26.09	LOG: Narrow transition size 2
58.93/26.09	Narrowing transition: 
58.93/26.09	<l2, l2, 1 + main_j <= main_i, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	
58.93/26.09	LOG: Narrow transition size 2
58.93/26.09	invGraph after Narrowing: 
58.93/26.09	Transitions:
58.93/26.09	<l2, l2, 1 + main_i <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	<l2, l2, 1 + main_j <= main_i, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	Variables:
58.93/26.09	main_i, main_j
58.93/26.09	Checking conditional termination of SCC {l2}...
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.001001s
58.93/26.09	Ranking function: 1 + main_i - main_j
58.93/26.09	New Graphs: 
58.93/26.09	Transitions:
58.93/26.09	<l2, l2, 1 + main_i <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	Variables:
58.93/26.09	main_i, main_j
58.93/26.09	Checking conditional termination of SCC {l2}...
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.000455s
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.001629s
58.93/26.09	[17242 : 17251]
58.93/26.09	[17242 : 17252]
58.93/26.09	Solving with 1 template(s).
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetFirstSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009421s
58.93/26.09	Time used: 0.009053
58.93/26.09	Improving Solution with cost 1 ...
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetNextSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016582s
58.93/26.09	Time used: 0.016576
58.93/26.09	
58.93/26.09	LOG: SAT solveNonLinear - Elapsed time: 0.026003s
58.93/26.09	Cost: 1; Total time: 0.025629
58.93/26.09	Quasi-ranking function: 50000 + main_i - main_j
58.93/26.09	New Graphs: 
58.93/26.09	Transitions:
58.93/26.09	<l2, l2, 50001 + main_i <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	Variables:
58.93/26.09	main_i, main_j
58.93/26.09	Checking conditional termination of SCC {l2}...
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.000465s
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.001844s
58.93/26.09	[17242 : 17256]
58.93/26.09	[17242 : 17257]
58.93/26.09	Solving with 1 template(s).
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetFirstSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009304s
58.93/26.09	Time used: 0.008837
58.93/26.09	Improving Solution with cost 1 ...
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetNextSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022133s
58.93/26.09	Time used: 0.022127
58.93/26.09	
58.93/26.09	LOG: SAT solveNonLinear - Elapsed time: 0.031436s
58.93/26.09	Cost: 1; Total time: 0.030964
58.93/26.09	Quasi-ranking function: 50000 - main_j
58.93/26.09	New Graphs: 
58.93/26.09	Transitions:
58.93/26.09	<l2, l2, 50001 + main_i <= main_j /\ 50001 <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	Variables:
58.93/26.09	main_i, main_j
58.93/26.09	Checking conditional termination of SCC {l2}...
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.000568s
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.002057s
58.93/26.09	[17242 : 17261]
58.93/26.09	[17242 : 17262]
58.93/26.09	Solving with 1 template(s).
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetFirstSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009985s
58.93/26.09	Time used: 0.009497
58.93/26.09	Improving Solution with cost 1 ...
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetNextSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017580s
58.93/26.09	Time used: 0.017575
58.93/26.09	
58.93/26.09	LOG: SAT solveNonLinear - Elapsed time: 0.027565s
58.93/26.09	Cost: 1; Total time: 0.027072
58.93/26.09	Quasi-ranking function: 50000 + main_i
58.93/26.09	New Graphs: 
58.93/26.09	Transitions:
58.93/26.09	<l2, l2, 50001 + main_i <= 0 /\ 50001 + main_i <= main_j /\ 50001 <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	Variables:
58.93/26.09	main_i, main_j
58.93/26.09	Checking conditional termination of SCC {l2}...
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.000641s
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.002742s
58.93/26.09	[17242 : 17266]
58.93/26.09	[17242 : 17267]
58.93/26.09	Solving with 1 template(s).
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetFirstSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010447s
58.93/26.09	Time used: 0.009903
58.93/26.09	Improving Solution with cost 1 ...
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetNextSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020535s
58.93/26.09	Time used: 0.02053
58.93/26.09	
58.93/26.09	LOG: SAT solveNonLinear - Elapsed time: 0.030983s
58.93/26.09	Cost: 1; Total time: 0.030433
58.93/26.09	Quasi-ranking function: 50000 + 3*main_i + 2*main_j
58.93/26.09	New Graphs: 
58.93/26.09	Transitions:
58.93/26.09	<l2, l2, 50001 + main_i <= 0 /\ 50001 + main_i <= main_j /\ 50001 + 3*main_i + 2*main_j <= 0 /\ 50001 <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	Variables:
58.93/26.09	main_i, main_j
58.93/26.09	Checking conditional termination of SCC {l2}...
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.000733s
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.003848s
58.93/26.09	[17242 : 17271]
58.93/26.09	[17242 : 17272]
58.93/26.09	Solving with 1 template(s).
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetFirstSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010353s
58.93/26.09	Time used: 0.009776
58.93/26.09	Improving Solution with cost 1 ...
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetNextSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018268s
58.93/26.09	Time used: 0.01826
58.93/26.09	
58.93/26.09	LOG: SAT solveNonLinear - Elapsed time: 0.028621s
58.93/26.09	Cost: 1; Total time: 0.028036
58.93/26.09	Quasi-ranking function: 50000 - main_i - 2*main_j
58.93/26.09	New Graphs: 
58.93/26.09	Transitions:
58.93/26.09	<l2, l2, 50001 + main_i <= 0 /\ 50001 + main_i <= main_j /\ 50001 <= main_i + 2*main_j /\ 50001 + 3*main_i + 2*main_j <= 0 /\ 50001 <= main_j, {main_i -> -1 + main_i, main_j -> 1 + main_j, rest remain the same}>
58.93/26.09	Variables:
58.93/26.09	main_i, main_j
58.93/26.09	Checking conditional termination of SCC {l2}...
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.000817s
58.93/26.09	
58.93/26.09	LOG: CALL solveLinear
58.93/26.09	
58.93/26.09	LOG: RETURN solveLinear - Elapsed time: 0.003909s
58.93/26.09	[17242 : 17276]
58.93/26.09	[17242 : 17277]
58.93/26.09	Solving with 1 template(s).
58.93/26.09	
58.93/26.09	LOG: CALL solveNonLinearGetFirstSolution
58.93/26.09	
58.93/26.09	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009811s
58.93/26.09	Time used: 0.009322
58.93/26.09	
58.93/26.09	[17242 : 17281]
58.93/26.09	[17242 : 17285]
58.93/26.09	Successful child: 17281
58.93/26.09	
58.93/26.09	Program does NOT terminate
58.93/26.09	EOF