NO

Solver Timeout: 4
Global Timeout: 60
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_j -> 100, main_i -> 0}>
<l1, l2, true>
<l2, l5, not((main_i < main_j))>
<l2, l3, (main_i < main_j)>
<l3, l4, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 1)}>
<l4, l2, true>
<l5, l6, 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_j -> 100, main_i -> 0}>
<l1, l2, true>
<l2, l3, (main_i < main_j)>
<l2, l5, not((main_i < main_j))>
<l3, l4, true, seq{main_j -> (main_j + 1), main_i -> (main_i + 1)}>
<l4, l2, true>
<l5, l6, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
6, 
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: 9, col: 5> <line: 11, col: 12> <line: 13, col: 9> <line: 13, col: 13>
j | local variable | integer | <line: 7, col: 5> | <line: 8, col: 5> <line: 11, col: 16> <line: 12, col: 9> <line: 12, col: 13>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_i = 0) /\ (main_j = 100)>
<l2, l2, (main_i < main_j), par{main_i -> (main_i + 1), main_j -> (main_j + 1)}>
<l2, l6, not((main_i < main_j))>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
6, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + main_i <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l6, main_j <= main_i, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 6 , 2 )

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000507s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001478s
[2399 : 2401]
[2399 : 2402]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007784s
Time used: 0.007459
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000433s
Time used: 1.00046

LOG: SAT solveNonLinear - Elapsed time: 1.008217s
Cost: 1; Total time: 1.00792
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= 1 + main_i
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + main_i <= main_j /\ 0 <= 1 + main_i, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + main_i <= main_j /\ 0 <= 1 + main_i, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
Quasi-ranking function: 50000 - 2*main_i + main_j
New Graphs: 
Transitions:
<l2, l2, 1 + main_i <= main_j /\ 0 <= 1 + main_i /\ 50001 + main_j <= 2*main_i, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000659s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002890s
[2399 : 2555]
[2399 : 2556]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009372s
Time used: 0.008775
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.025167s
Time used: 1.0249

LOG: SAT solveNonLinear - Elapsed time: 1.034539s
Cost: 1; Total time: 1.03368
Quasi-ranking function: 50000 - main_j
New Graphs: 
Transitions:
<l2, l2, 1 + main_i <= main_j /\ 0 <= 1 + main_i /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000728s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003047s
[2399 : 2560]
[2399 : 2561]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009722s
Time used: 0.008978
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000709s
Time used: 1.00073

LOG: SAT solveNonLinear - Elapsed time: 1.010432s
Cost: 1; Total time: 1.00971
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= main_i
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= main_i /\ 1 + main_i <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= main_i /\ 1 + main_i <= main_j /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
Quasi-ranking function: 50000 - main_i
New Graphs: 
Transitions:
<l2, l2, 1 + main_i <= main_j /\ 50001 <= main_i /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000740s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002768s
[2399 : 2565]
[2399 : 2566]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011168s
Time used: 0.010304
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.006826s
Time used: 1.00687

LOG: SAT solveNonLinear - Elapsed time: 1.017994s
Cost: 1; Total time: 1.01717
Quasi-ranking function: 50000 + main_i - 2*main_j
New Graphs: 
Transitions:
<l2, l2, 1 + main_i <= main_j /\ 50001 + main_i <= 2*main_j /\ 50001 <= main_i /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000826s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003504s
[2399 : 2570]
[2399 : 2571]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011409s
Time used: 0.010428
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000875s
Time used: 1.00077

LOG: SAT solveNonLinear - Elapsed time: 1.012284s
Cost: 1; Total time: 1.0112
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= main_i
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= main_i /\ 1 + main_i <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + main_i <= main_j /\ 50001 + main_i <= 2*main_j /\ 50001 <= main_i /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
Quasi-ranking function: 50000 - main_i - main_j
New Graphs: 
Transitions:
<l2, l2, 1 + main_i <= main_j /\ 50001 + main_i <= 2*main_j /\ 50001 <= main_i /\ 50001 <= main_i + main_j /\ 50001 + main_j <= 2*main_i /\ 50001 <= main_j, {main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000904s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004414s
[2399 : 2575]
[2399 : 2576]
Timeout expired!
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, main_i = 0 /\ main_j = 100, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, main_i = 0 /\ main_j = 100, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001337s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001445s
Cannot prove unreachability

[2399 : 2580]
[2399 : 2584]
Successful child: 2580

Program does NOT terminate