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_q -> ¿functionCall(__VERIFIER_nondet_int), main_p -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l1, l2, true>
0.00/0.04	<l2, l13, not((main_q > 0))>
0.00/0.04	<l2, l3, (main_q > 0)>
0.00/0.04	<l3, l13, not((main_p > 0))>
0.00/0.04	<l3, l4, (main_p > 0)>
0.00/0.04	<l4, l13, (main_p = main_q)>
0.00/0.04	<l4, l5, not((main_p = main_q))>
0.00/0.04	<l5, l6, (main_q < main_p)>
0.00/0.04	<l5, l8, not((main_q < main_p))>
0.00/0.04	<l6, l7, true, seq{main_q -> (main_q - 1), main_p -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l7, l12, true>
0.00/0.04	<l8, l9, (main_p < main_q)>
0.00/0.04	<l8, l11, not((main_p < main_q))>
0.00/0.04	<l9, l10, true, seq{main_p -> (main_p - 1), main_q -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l10, l11, true>
0.00/0.04	<l11, l12, true>
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_q -> 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_p -> varCall_2}>
0.00/0.04	<l1, l2, true>
0.00/0.04	<l2, l3, (main_q > 0)>
0.00/0.04	<l2, l13, not((main_q > 0))>
0.00/0.04	<l3, l4, (main_p > 0)>
0.00/0.04	<l3, l13, not((main_p > 0))>
0.00/0.04	<l4, l13, (main_p = main_q)>
0.00/0.04	<l4, l5, not((main_p = main_q))>
0.00/0.04	<l5, l6, (main_q < main_p)>
0.00/0.04	<l5, l8, not((main_q < main_p))>
0.00/0.04	<l6, l19, true, seq{main_q -> (main_q - 1)}>
0.00/0.04	<l19, l20, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l20, l7, true, seq{main_p -> varCall_3}>
0.00/0.04	<l7, l12, true>
0.00/0.04	<l8, l9, (main_p < main_q)>
0.00/0.04	<l8, l11, not((main_p < main_q))>
0.00/0.04	<l9, l21, true, seq{main_p -> (main_p - 1)}>
0.00/0.04	<l21, l22, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.04	<l22, l10, true, seq{main_q -> varCall_4}>
0.00/0.04	<l10, l11, true>
0.00/0.04	<l11, l12, true>
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 [4 idents]:
0.00/0.04	__VERIFIER_nondet_int | function | [integer, ()] | <line: 15, col: 1> | <line: 20, col: 6> <line: 21, col: 6> <line: 25, col: 8> <line: 28, col: 8>
0.00/0.04	main | function | [integer, ()] | <line: 17, col: 1>
0.00/0.04	p | local variable | integer | <line: 19, col: 5> | <line: 21, col: 2> <line: 22, col: 18> <line: 22, col: 27> <line: 23, col: 11> <line: 25, col: 4> <line: 26, col: 15> <line: 27, col: 4> <line: 27, col: 8>
0.00/0.04	q | local variable | integer | <line: 19, col: 5> | <line: 20, col: 2> <line: 22, col: 9> <line: 22, col: 32> <line: 23, col: 7> <line: 24, col: 4> <line: 24, col: 8> <line: 26, col: 19> <line: 28, col: 4>
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_p = undef6) /\ (main_q = undef5)>
0.00/0.04	<l2, l14, (main_q > 0) /\ (main_p > 0) /\ (main_p = main_q)>
0.00/0.04	<l2, l2, (main_q > 0) /\ (main_p > 0) /\ (main_p < main_q) /\ not((main_q < main_p)) /\ (main_p < main_q), par{main_p -> (main_p - 1), main_q -> undef8}>
0.00/0.04	<l2, l2, (main_q > 0) /\ (main_p > 0) /\ (main_p > main_q) /\ (main_q < main_p), par{main_p -> undef7, main_q -> (main_q - 1)}>
0.00/0.04	<l2, l14, (main_q > 0) /\ not((main_p > 0))>
0.00/0.04	<l2, l14, not((main_q > 0))>
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_p <= main_q /\ 1 <= main_p /\ 1 <= main_q, {main_p -> -1 + main_p, main_q -> undef8, rest remain the same}>
0.00/0.04	<l2, l2, 1 <= main_p /\ 1 + main_q <= main_p /\ 1 <= main_q, {main_p -> undef7, main_q -> -1 + main_q, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_p, main_q
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_p = undef6 /\ main_q = undef5, {all remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l2, l14, 1 <= main_p /\ 1 <= main_q /\ main_p = main_q, {all remain the same}>
0.00/0.04	<l2, l14, main_p <= 0 /\ 1 <= main_q, {all remain the same}>
0.00/0.04	<l2, l14, main_q <= 0, {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.003591
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.001170s
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.006130s
0.00/0.04	Piecewise ranking function: min(-2 + main_q,-1 + main_p)
0.00/0.04	New Graphs: 
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, 1 <= main_p /\ 1 + main_q <= main_p /\ 1 <= main_q, {main_p -> undef7, main_q -> -1 + main_q, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_p, main_q
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.000815s
0.00/0.04	Ranking function: -1 + main_q
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