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