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 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l9, not((main_i < 255))>
<l2, l3, (main_i < 255)>
<l3, l4, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
<l3, l6, (¿functionCall(__VERIFIER_nondet_int) = 0)>
<l4, l5, true, seq{main_i -> (main_i + 1)}>
<l5, l8, true>
<l6, l7, true, seq{main_i -> (main_i + 2)}>
<l7, l8, true>
<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, l11, true, seq{main__func_return_ -> 0}>
<l11, l12, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l12, l1, true, seq{main_i -> varCall_1}>
<l1, l2, true>
<l2, l3, (main_i < 255)>
<l2, l9, not((main_i < 255))>
<l3, l13, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l13, l6, (varCall_2 = 0)>
<l13, l4, (varCall_2 = 1)>
<l4, l5, true, seq{main_i -> (main_i + 1)}>
<l5, l8, true>
<l6, l7, true, seq{main_i -> (main_i + 2)}>
<l7, l8, true>
<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 [2 functions]:
    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
        __VERIFIER_nondet_int__func_return_      [function result] : int
    function name: main [1 return + 0 parameters]        demangled: main
        main__func_return_      [function result] : int


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

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_i = undef3)>
<l2, l2, (main_i < 255) /\ (undef4 = 0), par{main_i -> (main_i + 2)}>
<l2, l2, (main_i < 255) /\ (undef4 = 1), par{main_i -> (main_i + 1)}>
<l2, l10, not((main_i < 255))>

Fresh variables:
undef3, undef4, 

Undef variables:
undef3, undef4, 

Abstraction variables:

Exit nodes:
10, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, main_i <= 254 /\ undef4 = 0, {main_i -> 2 + main_i, rest remain the same}>
<l2, l2, main_i <= 254 /\ undef4 = 1, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_i = undef3, {all remain the same}>

Graph 2
<l2, l10, 255 <= main_i, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

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

Program Terminates