YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
*******************************************************************************************
*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
*******************************************************************************************


List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :

+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
+                                                                  +
Init Location: 0
Transitions:
<l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0, main_j -> 3}>
<l1, l2, true>
<l2, l9, not((main_i < 10))>
<l2, l3, (main_i < 10)>
<l3, l4, true>
<l4, l7, not((main_j < 12))>
<l4, l5, (main_j < 12)>
<l5, l6, true, seq{main_j -> (main_j - 1), main_j -> (main_j + 2)}>
<l6, l4, true>
<l7, l8, true, seq{main_i -> (main_i + 1)}>
<l8, l2, true>
<l9, l10, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
       
+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
       
+ After preprocess (paralelization): ++++++++++++++++++++++++++++++

Init Location: 0
Transitions:
<l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0, main_j -> 3}>
<l1, l2, true>
<l2, l3, (main_i < 10)>
<l2, l9, not((main_i < 10))>
<l3, l4, true>
<l4, l5, (main_j < 12)>
<l4, l7, not((main_j < 12))>
<l5, l6, true, seq{main_j -> (main_j - 1), main_j -> (main_j + 2)}>
<l6, l4, true>
<l7, l8, true, seq{main_i -> (main_i + 1)}>
<l8, l2, true>
<l9, l10, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
10, 
Accepting locations:

Asserts:

+                                                                  +
+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++


Function Return and Parameters Information [1 functions]:
    function name: main [1 return + 0 parameters]        demangled: main
        main__func_return_      [function result] : int


AST Ident Scanner Information [4 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
main | function | [integer, ()] | <line: 5, col: 1>
i | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 11, col: 12> <line: 16, col: 9> <line: 16, col: 13>
j | local variable | integer | <line: 7, col: 5> | <line: 9, col: 5> <line: 12, col: 16> <line: 13, col: 13> <line: 13, col: 17> <line: 14, col: 13> <line: 14, col: 17>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (main_i = 0) /\ (main_j = 3) /\ (0 < 10)>
<l4, l4, (main_j < 12), par{main_j -> ((main_j - 1) + 2)}>
<l4, l4, not((main_j < 12)) /\ ((main_i + 1) < 10), par{main_i -> (main_i + 1)}>
<l4, l10, not((main_j < 12)) /\ not(((main_i + 1) < 10)), par{main_i -> (main_i + 1)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
10, 
Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, main_j <= 11, {main_j -> 1 + main_j, rest remain the same}>
<l4, l4, 12 <= main_j /\ main_i <= 8, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_j, main_i

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, main_i = 0 /\ main_j = 3, {all remain the same}>

Graph 2
<l4, l10, 12 <= main_j /\ 9 <= main_i, {main_i -> 1 + main_i, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 4 , 1 )
( 10 , 2 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.016711

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000591s
Ranking function: 10 - main_i
New Graphs: 
Transitions:
<l4, l4, main_j <= 11, {main_j -> 1 + main_j, rest remain the same}>
Variables:
main_j
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000222s
Ranking function: 11 - main_j
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l10}...
No cycles found.

Program Terminates