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_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
<l1, l4, (¿functionCall(__VERIFIER_nondet_int) = 0)>
<l2, l3, true, seq{main_x -> 1}>
<l3, l6, true>
<l4, l5, true, seq{main_x -> ~(1)}>
<l5, l6, true>
<l6, l7, true>
<l7, l11, not((main_y < 100))>
<l7, l8, (main_y < 100)>
<l8, l11, not((main_z < 100))>
<l8, l9, (main_z < 100)>
<l9, l10, true, seq{main_y -> (main_y + main_x), main_z -> (main_z - main_x)}>
<l10, l7, true>
<l11, l12, 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, l13, true, seq{main__func_return_ -> 0}>
<l13, l14, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l14, l15, true, seq{main_y -> varCall_1}>
<l15, l16, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l16, l1, true, seq{main_z -> varCall_2}>
<l1, l17, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l17, l4, (varCall_3 = 0)>
<l17, l2, (varCall_3 = 1)>
<l2, l3, true, seq{main_x -> 1}>
<l3, l6, true>
<l4, l5, true, seq{main_x -> ~(1)}>
<l5, l6, true>
<l6, l7, true>
<l7, l8, (main_y < 100)>
<l7, l11, not((main_y < 100))>
<l8, l9, (main_z < 100)>
<l8, l11, not((main_z < 100))>
<l9, l10, true, seq{main_y -> (main_y + main_x), main_z -> (main_z - main_x)}>
<l10, l7, true>
<l11, l12, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
12, 
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 [5 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 17, col: 6> <line: 18, col: 6> <line: 19, col: 9>
main | function | [integer, ()] | <line: 13, col: 1>
x | local variable | integer | <line: 14, col: 5> | <line: 20, col: 9> <line: 22, col: 9> <line: 25, col: 15> <line: 26, col: 15>
y | local variable | integer | <line: 15, col: 2> | <line: 17, col: 2> <line: 24, col: 12> <line: 25, col: 9> <line: 25, col: 13>
z | local variable | integer | <line: 16, col: 2> | <line: 18, col: 2> <line: 24, col: 21> <line: 26, col: 9> <line: 26, col: 13>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, (main_y = undef4) /\ (main_z = undef5) /\ (undef6 = 0), par{main_x -> ~(1)}>
<l0, l7, (main_y = undef4) /\ (main_z = undef5) /\ (undef6 = 1), par{main_x -> 1}>
<l7, l7, (main_y < 100) /\ (main_z < 100), par{main_y -> (main_y + main_x), main_z -> (main_z - main_x)}>
<l7, l12, (main_y < 100) /\ not((main_z < 100))>
<l7, l12, not((main_y < 100))>

Fresh variables:
undef4, undef5, undef6, 

Undef variables:
undef4, undef5, undef6, 

Abstraction variables:

Exit nodes:
12, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l7, l7, main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
Variables:
main_x, main_y, main_z

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l7, main_y = undef4 /\ main_z = undef5 /\ undef6 = 0, {main_x -> -1, rest remain the same}>
<l0, l7, main_y = undef4 /\ main_z = undef5 /\ undef6 = 1, {main_x -> 1, rest remain the same}>

Graph 2
<l7, l12, 100 <= main_z /\ main_y <= 99, {all remain the same}>
<l7, l12, 100 <= main_y, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 7 , 1 )
( 12 , 2 )

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

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

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000318s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000940s
[4823 : 4825]
[4823 : 4826]
Successful child: 4825
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 1 <= main_x /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, 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): 
<l7, l7, 1 <= main_x /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
Ranking function: 99 - main_y
New Graphs: 

LOG: CALL check - Post:1 <= main_x - Process 1
* Exit transition: <l0, l7, main_y = undef4 /\ main_z = undef5 /\ undef6 = 0, {main_x -> -1, rest remain the same}>
* Postcondition  : 1 <= main_x

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000390s
INVARIANTS: 
7: 
Quasi-INVARIANTS to narrow Graph: 
7: 1 <= main_x , 
Narrowing transition: 
<l7, l7, main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l7, l7, main_x <= 0 /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
Variables:
main_x, main_y, main_z
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000419s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001448s
[4823 : 4830]
[4823 : 4831]
Successful child: 4830
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 1 + main_x <= 0 /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, 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): 
<l7, l7, 1 + main_x <= 0 /\ main_y <= 99 /\ main_z <= 99, {main_y -> main_x + main_y, main_z -> -main_x + main_z, rest remain the same}>
Ranking function: 197 - main_z
New Graphs: 
INVARIANTS: 
7: 1 + main_x <= 0 , 
Quasi-INVARIANTS to narrow Graph: 
7: 
Proving termination of subgraph 2
Analyzing SCC {l12}...
No cycles found.

Program Terminates