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