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