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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_c -> 0}>
<l1, l2, true>
<l2, l10, not((main_x >= 0))>
<l2, l3, (main_x >= 0)>
<l3, l4, true, seq{main_y -> 1}>
<l4, l5, true>
<l5, l8, not((main_x > main_y))>
<l5, l6, (main_x > main_y)>
<l6, l7, true, seq{main_y -> (2 * main_y), main_c -> (main_c + 1)}>
<l7, l5, true>
<l8, l9, true, seq{main_x -> (main_x - 1)}>
<l9, l2, true>
<l10, l11, 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, l12, true, seq{main__func_return_ -> 0}>
<l12, l13, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l13, l14, true, seq{main_x -> varCall_1}>
<l14, l15, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l15, l1, true, seq{main_y -> varCall_2, main_c -> 0}>
<l1, l2, true>
<l2, l3, (main_x >= 0)>
<l2, l10, not((main_x >= 0))>
<l3, l4, true, seq{main_y -> 1}>
<l4, l5, true>
<l5, l6, (main_x > main_y)>
<l5, l8, not((main_x > main_y))>
<l6, l7, true, seq{main_y -> (2 * main_y), main_c -> (main_c + 1)}>
<l7, l5, true>
<l8, l9, true, seq{main_x -> (main_x - 1)}>
<l9, l2, true>
<l10, l11, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
11, 
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: 3, col: 1> | <line: 7, col: 9> <line: 8, col: 9>
main | function | [integer, ()] | <line: 5, col: 1>
c | local variable | integer | <line: 6, col: 5> | <line: 9, col: 5> <line: 14, col: 13> <line: 14, col: 17>
x | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 10, col: 12> <line: 12, col: 16> <line: 16, col: 9> <line: 16, col: 13>
y | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 11, col: 9> <line: 12, col: 20> <line: 13, col: 13> <line: 13, col: 19>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (main_c = 0) /\ (main_x = undef3) /\ (undef3 >= 0), par{main_y -> 1}>
<l0, l11, (main_c = 0) /\ (main_x = undef3) /\ not((undef3 >= 0)), par{main_y -> undef4}>
<l5, l5, (main_x > main_y), par{main_c -> (main_c + 1), main_y -> (2 * main_y)}>
<l5, l5, not((main_x > main_y)) /\ ((main_x - 1) >= 0), par{main_x -> (main_x - 1), main_y -> 1}>
<l5, l11, not((main_x > main_y)) /\ not(((main_x - 1) >= 0)), par{main_x -> (main_x - 1)}>

Fresh variables:
undef3, undef4, 

Undef variables:
undef3, undef4, 

Abstraction variables:

Exit nodes:
11, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l5, 1 + main_y <= main_x, {main_c -> 1 + main_c, main_y -> 2*main_y, rest remain the same}>
<l5, l5, main_x <= main_y /\ 1 <= main_x, {main_x -> -1 + main_x, main_y -> 1, rest remain the same}>
Variables:
main_c, main_x, main_y

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, 0 <= undef3 /\ main_c = 0 /\ main_x = undef3, {main_y -> 1, rest remain the same}>

Graph 2
<l0, l11, 1 + undef3 <= 0 /\ main_c = 0 /\ main_x = undef3, {main_y -> undef4, rest remain the same}>
<l5, l11, main_x <= 0 /\ main_x <= main_y, {main_x -> -1 + main_x, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 5 , 1 )
( 11 , 2 )

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

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

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000953s
Ranking function: main_x
New Graphs: 
Transitions:
<l5, l5, 1 + main_y <= main_x, {main_c -> 1 + main_c, main_y -> 2*main_y, rest remain the same}>
Variables:
main_c, main_x, main_y
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000422s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001196s
[29470 : 29472]
[29470 : 29473]
Successful child: 29472
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + main_y <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y, {main_c -> 1 + main_c, main_y -> 2*main_y, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

Program Terminates