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_i -> 0, main_c -> 0}>
0.00/0.04	<l1, l2, true>
0.00/0.04	<l2, l9, not((main_i < 20))>
0.00/0.04	<l2, l3, (main_i < 20)>
0.00/0.04	<l3, l4, true, seq{main_i -> (main_i + 1)}>
0.00/0.04	<l4, l5, (main_i <= 10)>
0.00/0.04	<l4, l6, not((main_i <= 10))>
0.00/0.04	<l5, l8, true>
0.00/0.04	<l6, l7, true, seq{main_c -> (main_c + 1)}>
0.00/0.04	<l7, l8, true>
0.00/0.04	<l8, l2, true>
0.00/0.04	<l9, l10, 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, l1, true, seq{main__func_return_ -> 0, main_i -> 0, main_c -> 0}>
0.00/0.04	<l1, l2, true>
0.00/0.04	<l2, l3, (main_i < 20)>
0.00/0.04	<l2, l9, not((main_i < 20))>
0.00/0.04	<l3, l4, true, seq{main_i -> (main_i + 1)}>
0.00/0.04	<l4, l5, (main_i <= 10)>
0.00/0.04	<l4, l6, not((main_i <= 10))>
0.00/0.04	<l5, l8, true>
0.00/0.04	<l6, l7, true, seq{main_c -> (main_c + 1)}>
0.00/0.04	<l7, l8, true>
0.00/0.04	<l8, l2, true>
0.00/0.04	<l9, l10, 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	10, 
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 [1 functions]:
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: 3, col: 1>
0.00/0.04	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.04	i | local variable | integer | <line: 6, col: 2> | <line: 8, col: 2> <line: 10, col: 9> <line: 11, col: 6> <line: 11, col: 10> <line: 12, col: 10>
0.00/0.04	c | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 14, col: 13> <line: 14, col: 17>
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_i = 0) /\ (main_c = 0)>
0.00/0.04	<l2, l2, (main_i < 20) /\ ((main_i + 1) <= 10), par{main_i -> (main_i + 1)}>
0.00/0.04	<l2, l2, (main_i < 20) /\ not(((main_i + 1) <= 10)), par{main_i -> (main_i + 1), main_c -> (main_c + 1)}>
0.00/0.04	<l2, l10, not((main_i < 20))>
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	10, 
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, main_i <= 9, {main_i -> 1 + main_i, rest remain the same}>
0.00/0.04	<l2, l2, 10 <= main_i /\ main_i <= 19, {main_i -> 1 + main_i, main_c -> 1 + main_c, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_i, main_c
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_i = 0 /\ main_c = 0, {all remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l2, l10, 20 <= main_i, {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	( 10 , 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.014306
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.001246s
0.00/0.04	Ranking function: 180 - 20*main_i
0.00/0.04	New Graphs: 
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, 10 <= main_i /\ main_i <= 19, {main_i -> 1 + main_i, main_c -> 1 + main_c, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	main_i, main_c
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.000633s
0.00/0.04	Ranking function: 19 - main_i
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Analyzing SCC {l10}...
0.00/0.04	No cycles found.
0.00/0.04	
0.00/0.04	Program Terminates
0.00/0.04	EOF