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