4.13/4.14	YES
4.13/4.14	
4.13/4.14	Solver Timeout: 4
4.13/4.14	Global Timeout: 300
4.13/4.14	Maximum number of concurrent processes: 900
4.13/4.14	*******************************************************************************************
4.13/4.14	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
4.13/4.14	*******************************************************************************************
4.13/4.14	
4.13/4.14	
4.13/4.14	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
4.13/4.14	
4.13/4.14	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
4.13/4.14	+                                                                  +
4.13/4.14	Init Location: 0
4.13/4.14	Transitions:
4.13/4.14	<l0, l1, true, seq{main__func_return_ -> 0, main_x1 -> ¿functionCall(__VERIFIER_nondet_int), main_x2 -> ¿functionCall(__VERIFIER_nondet_int)}>
4.13/4.14	<l1, l2, true>
4.13/4.14	<l2, l10, not((main_x1 <= 10))>
4.13/4.14	<l2, l3, (main_x1 <= 10)>
4.13/4.14	<l3, l4, true, seq{main_x2 -> 10}>
4.13/4.14	<l4, l5, true>
4.13/4.14	<l5, l8, not((main_x2 > 1))>
4.13/4.14	<l5, l6, (main_x2 > 1)>
4.13/4.14	<l6, l7, true, seq{main_x2 -> (main_x2 - 1)}>
4.13/4.14	<l7, l5, true>
4.13/4.14	<l8, l9, true, seq{main_x1 -> (main_x1 + 1)}>
4.13/4.14	<l9, l2, true>
4.13/4.14	<l10, l11, true, seq{main__func_return_ -> 0}>
4.13/4.14	
4.13/4.14	Fresh variables:
4.13/4.14	
4.13/4.14	Undef variables:
4.13/4.14	
4.13/4.14	Abstraction variables:
4.13/4.14	
4.13/4.14	Exit nodes:
4.13/4.14	
4.13/4.14	Accepting locations:
4.13/4.14	
4.13/4.14	Asserts:
4.13/4.14	
4.13/4.14	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
4.13/4.14	       
4.13/4.14	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
4.13/4.14	       
4.13/4.14	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
4.13/4.14	
4.13/4.14	Init Location: 0
4.13/4.14	Transitions:
4.13/4.14	<l0, l12, true, seq{main__func_return_ -> 0}>
4.13/4.14	<l12, l13, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
4.13/4.14	<l13, l14, true, seq{main_x1 -> varCall_1}>
4.13/4.14	<l14, l15, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
4.13/4.14	<l15, l1, true, seq{main_x2 -> varCall_2}>
4.13/4.14	<l1, l2, true>
4.13/4.14	<l2, l3, (main_x1 <= 10)>
4.13/4.14	<l2, l10, not((main_x1 <= 10))>
4.13/4.14	<l3, l4, true, seq{main_x2 -> 10}>
4.13/4.14	<l4, l5, true>
4.13/4.14	<l5, l6, (main_x2 > 1)>
4.13/4.14	<l5, l8, not((main_x2 > 1))>
4.13/4.14	<l6, l7, true, seq{main_x2 -> (main_x2 - 1)}>
4.13/4.14	<l7, l5, true>
4.13/4.14	<l8, l9, true, seq{main_x1 -> (main_x1 + 1)}>
4.13/4.14	<l9, l2, true>
4.13/4.14	<l10, l11, true, seq{main__func_return_ -> 0}>
4.13/4.14	
4.13/4.14	Fresh variables:
4.13/4.14	
4.13/4.14	Undef variables:
4.13/4.14	
4.13/4.14	Abstraction variables:
4.13/4.14	
4.13/4.14	Exit nodes:
4.13/4.14	11, 
4.13/4.14	Accepting locations:
4.13/4.14	
4.13/4.14	Asserts:
4.13/4.14	
4.13/4.14	+                                                                  +
4.13/4.14	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
4.13/4.14	
4.13/4.14	
4.13/4.14	Function Return and Parameters Information [2 functions]:
4.13/4.14	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
4.13/4.14	        __VERIFIER_nondet_int__func_return_      [function result] : int
4.13/4.14	    function name: main [1 return + 0 parameters]        demangled: main
4.13/4.14	        main__func_return_      [function result] : int
4.13/4.14	
4.13/4.14	
4.13/4.14	AST Ident Scanner Information [4 idents]:
4.13/4.14	__VERIFIER_nondet_int | function | [integer, ()] | <line: 12, col: 1> | <line: 17, col: 7> <line: 18, col: 7>
4.13/4.14	main | function | [integer, ()] | <line: 14, col: 1>
4.13/4.14	x1 | local variable | integer | <line: 15, col: 2> | <line: 17, col: 2> <line: 19, col: 12> <line: 24, col: 9> <line: 24, col: 14>
4.13/4.14	x2 | local variable | integer | <line: 16, col: 2> | <line: 18, col: 2> <line: 20, col: 9> <line: 21, col: 16> <line: 22, col: 13> <line: 22, col: 18>
4.13/4.14	
4.13/4.14	Main function: main
4.13/4.14	Preprocessed LLVMGraph
4.13/4.14	Init Location: 0
4.13/4.14	Transitions:
4.13/4.14	<l0, l5, (main_x1 = undef3) /\ (undef3 <= 10), par{main_x2 -> 10}>
4.13/4.14	<l0, l11, (main_x1 = undef3) /\ not((undef3 <= 10)), par{main_x2 -> undef4}>
4.13/4.14	<l5, l5, (main_x2 > 1), par{main_x2 -> (main_x2 - 1)}>
4.13/4.14	<l5, l5, not((main_x2 > 1)) /\ ((main_x1 + 1) <= 10), par{main_x1 -> (main_x1 + 1), main_x2 -> 10}>
4.13/4.14	<l5, l11, not((main_x2 > 1)) /\ not(((main_x1 + 1) <= 10)), par{main_x1 -> (main_x1 + 1)}>
4.13/4.14	
4.13/4.14	Fresh variables:
4.13/4.14	undef3, undef4, 
4.13/4.14	
4.13/4.14	Undef variables:
4.13/4.14	undef3, undef4, 
4.13/4.14	
4.13/4.14	Abstraction variables:
4.13/4.14	
4.13/4.14	Exit nodes:
4.13/4.14	11, 
4.13/4.14	Accepting locations:
4.13/4.14	
4.13/4.14	Asserts:
4.13/4.14	
4.13/4.14	*************************************************************
4.13/4.14	*******************************************************************************************
4.13/4.14	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
4.13/4.14	*******************************************************************************************
4.13/4.14	
4.13/4.14	Init Location: 0
4.13/4.14	Graph 0:
4.13/4.14	Transitions:
4.13/4.14	Variables:
4.13/4.14	
4.13/4.14	Graph 1:
4.13/4.14	Transitions:
4.13/4.14	<l5, l5, 2 <= main_x2, {main_x2 -> -1 + main_x2, rest remain the same}>
4.13/4.14	<l5, l5, main_x2 <= 1 /\ main_x1 <= 9, {main_x1 -> 1 + main_x1, main_x2 -> 10, rest remain the same}>
4.13/4.14	Variables:
4.13/4.14	main_x2, main_x1
4.13/4.14	
4.13/4.14	Graph 2:
4.13/4.14	Transitions:
4.13/4.14	Variables:
4.13/4.14	
4.13/4.14	Precedence: 
4.13/4.14	Graph 0
4.13/4.14	
4.13/4.14	Graph 1
4.13/4.14	<l0, l5, undef3 <= 10 /\ main_x1 = undef3, {main_x2 -> 10, rest remain the same}>
4.13/4.14	
4.13/4.14	Graph 2
4.13/4.14	<l0, l11, 11 <= undef3 /\ main_x1 = undef3, {main_x2 -> undef4, rest remain the same}>
4.13/4.14	<l5, l11, 10 <= main_x1 /\ main_x2 <= 1, {main_x1 -> 1 + main_x1, rest remain the same}>
4.13/4.14	
4.13/4.14	Map Locations to Subgraph:
4.13/4.14	( 0 , 0 )
4.13/4.14	( 5 , 1 )
4.13/4.14	( 11 , 2 )
4.13/4.14	
4.13/4.14	*******************************************************************************************
4.13/4.14	********************************    CHECKING ASSERTIONS    ********************************
4.13/4.14	*******************************************************************************************
4.13/4.14	
4.13/4.14	Proving termination of subgraph 0
4.13/4.14	Proving termination of subgraph 1
4.13/4.14	Checking unfeasibility...
4.13/4.14	Time used: 4.1007
4.13/4.14	
4.13/4.14	Checking conditional termination of SCC {l5}...
4.13/4.14	
4.13/4.14	LOG: CALL solveLinear
4.13/4.14	
4.13/4.14	LOG: RETURN solveLinear - Elapsed time: 0.009782s
4.13/4.14	Ranking function: 9 - main_x1
4.13/4.14	New Graphs: 
4.13/4.14	Transitions:
4.13/4.14	<l5, l5, 2 <= main_x2, {main_x2 -> -1 + main_x2, rest remain the same}>
4.13/4.14	Variables:
4.13/4.14	main_x2
4.13/4.14	Checking conditional termination of SCC {l5}...
4.13/4.14	
4.13/4.14	LOG: CALL solveLinear
4.13/4.14	
4.13/4.14	LOG: RETURN solveLinear - Elapsed time: 0.000490s
4.13/4.14	Ranking function: -2 + main_x2
4.13/4.14	New Graphs: 
4.13/4.14	Proving termination of subgraph 2
4.13/4.14	Analyzing SCC {l11}...
4.13/4.14	No cycles found.
4.13/4.14	
4.13/4.14	Program Terminates
4.13/4.14	EOF