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_n -> ¿functionCall(__VERIFIER_nondet_int), main_m -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l1, l13, not((main_n >= 0))>
0.00/0.06	<l1, l2, (main_n >= 0)>
0.00/0.06	<l2, l3, (main_m > 0)>
0.00/0.06	<l2, l13, not((main_m > 0))>
0.00/0.06	<l3, l4, true, seq{main_v1 -> main_n, main_v2 -> 0}>
0.00/0.06	<l4, l5, true>
0.00/0.06	<l5, l12, not((main_v1 > 0))>
0.00/0.06	<l5, l6, (main_v1 > 0)>
0.00/0.06	<l6, l7, (main_v2 < main_m)>
0.00/0.06	<l6, l9, not((main_v2 < main_m))>
0.00/0.06	<l7, l8, true, seq{main_v2 -> (main_v2 + 1), main_v1 -> (main_v1 - 1)}>
0.00/0.06	<l8, l11, true>
0.00/0.06	<l9, l10, true, seq{main_v2 -> 0}>
0.00/0.06	<l10, l11, true>
0.00/0.06	<l11, l5, 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_n -> varCall_1}>
0.00/0.06	<l17, l18, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.06	<l18, l1, true, seq{main_m -> varCall_2}>
0.00/0.06	<l1, l2, (main_n >= 0)>
0.00/0.06	<l1, l13, not((main_n >= 0))>
0.00/0.06	<l2, l3, (main_m > 0)>
0.00/0.06	<l2, l13, not((main_m > 0))>
0.00/0.06	<l3, l4, true, seq{main_v1 -> main_n, main_v2 -> 0}>
0.00/0.06	<l4, l5, true>
0.00/0.06	<l5, l6, (main_v1 > 0)>
0.00/0.06	<l5, l12, not((main_v1 > 0))>
0.00/0.06	<l6, l7, (main_v2 < main_m)>
0.00/0.06	<l6, l9, not((main_v2 < main_m))>
0.00/0.06	<l7, l8, true, seq{main_v2 -> (main_v2 + 1), main_v1 -> (main_v1 - 1)}>
0.00/0.06	<l8, l11, true>
0.00/0.06	<l9, l10, true, seq{main_v2 -> 0}>
0.00/0.06	<l10, l11, true>
0.00/0.06	<l11, l5, 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	14, 
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+                                                                  +
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	
0.00/0.06	Function Return and Parameters Information [2 functions]:
0.00/0.06	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.06	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.06	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.06	        main__func_return_      [function result] : int
0.00/0.06	
0.00/0.06	
0.00/0.06	AST Ident Scanner Information [6 idents]:
0.00/0.06	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 6>
0.00/0.06	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.06	m | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 17, col: 16> <line: 21, col: 13>
0.00/0.06	n | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2> <line: 17, col: 6> <line: 18, col: 8>
0.00/0.06	v1 | local variable | integer | <line: 14, col: 5> | <line: 18, col: 3> <line: 20, col: 10> <line: 23, col: 5> <line: 23, col: 10>
0.00/0.06	v2 | local variable | integer | <line: 14, col: 5> | <line: 19, col: 3> <line: 21, col: 8> <line: 22, col: 5> <line: 22, col: 10> <line: 25, col: 5>
0.00/0.06	
0.00/0.06	Main function: main
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l5, (main_m = undef4) /\ (undef3 >= 0) /\ (undef4 > 0), par{main_v1 -> undef3, main_v2 -> 0}>
0.00/0.06	<l0, l14, (main_m = undef4) /\ (undef3 >= 0) /\ not((undef4 > 0))>
0.00/0.06	<l0, l14, (main_m = undef4) /\ not((undef3 >= 0))>
0.00/0.06	<l5, l5, (main_v1 > 0) /\ (main_v2 < main_m), par{main_v1 -> (main_v1 - 1), main_v2 -> (main_v2 + 1)}>
0.00/0.06	<l5, l5, (main_v1 > 0) /\ not((main_v2 < main_m)), par{main_v2 -> 0}>
0.00/0.06	<l5, l14, not((main_v1 > 0))>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef3, undef4, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef3, undef4, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	14, 
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l5, l5, 1 + main_v2 <= main_m /\ 1 <= main_v1, {main_v1 -> -1 + main_v1, main_v2 -> 1 + main_v2, rest remain the same}>
0.00/0.06	<l5, l5, main_m <= main_v2 /\ 1 <= main_v1, {main_v2 -> 0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_m, main_v1, main_v2
0.00/0.06	
0.00/0.06	Graph 2:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l5, 0 <= undef3 /\ 1 <= undef4 /\ main_m = undef4, {main_v1 -> undef3, main_v2 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l0, l14, 0 <= undef3 /\ undef4 <= 0 /\ main_m = undef4, {all remain the same}>
0.00/0.06	<l0, l14, 1 + undef3 <= 0 /\ main_m = undef4, {all remain the same}>
0.00/0.06	<l5, l14, main_v1 <= 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 5 , 1 )
0.00/0.06	( 14 , 2 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.005152
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l5}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001260s
0.00/0.06	Ranking function: -1 + main_v1
0.00/0.06	New Graphs: 
0.00/0.06	Transitions:
0.00/0.06	<l5, l5, main_m <= main_v2 /\ 1 <= main_v1, {main_v2 -> 0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_m, main_v1, main_v2
0.00/0.06	Checking conditional termination of SCC {l5}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000772s
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.002122s
0.00/0.06	[26836 : 26840]
0.00/0.06	[26836 : 26841]
0.00/0.06	Successful child: 26840
0.00/0.06	[ Invariant Graph ]
0.00/0.06	Strengthening and disabling transitions...
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l5, l5, 1 <= main_m /\ 1 + main_v2 <= main_m /\ 1 <= main_v1, {main_v1 -> -1 + main_v1, main_v2 -> 1 + main_v2, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l5, l5, main_m <= main_v2 /\ 1 <= main_m /\ 1 <= main_v1, {main_v2 -> 0, rest remain the same}>
0.00/0.06	[ Termination Graph ]
0.00/0.06	Strengthening and disabling transitions...
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l5, l5, main_m <= main_v2 /\ 1 <= main_m /\ 1 <= main_v1, {main_v2 -> 0, rest remain the same}>
0.00/0.06	Ranking function: -main_m + main_v1 + main_v2
0.00/0.06	New Graphs: 
0.00/0.06	INVARIANTS: 
0.00/0.06	5: 1 <= main_m , 
0.00/0.06	Quasi-INVARIANTS to narrow Graph: 
0.00/0.06	5: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Analyzing SCC {l14}...
0.00/0.06	No cycles found.
0.00/0.06	
0.00/0.06	Program Terminates
0.00/0.06	EOF