YES

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_x -> ¿functionCall(__VERIFIER_nondet_int), main_d1 -> ¿functionCall(__VERIFIER_nondet_int), main_d2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l5, not((main_x >= 0))>
<l2, l3, (main_x >= 0)>
<l3, l4, true, seq{main_x -> (main_x - main_d1), main_d1old -> main_d1, main_d1 -> (main_d2 + 1), main_d2 -> (main_d1old + 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, l7, true, seq{main__func_return_ -> 0}>
<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l8, l9, true, seq{main_x -> varCall_1}>
<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l10, l11, true, seq{main_d1 -> varCall_2}>
<l11, l12, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l12, l1, true, seq{main_d2 -> varCall_3}>
<l1, l2, true>
<l2, l3, (main_x >= 0)>
<l2, l5, not((main_x >= 0))>
<l3, l4, true, seq{main_x -> (main_x - main_d1), main_d1old -> main_d1, main_d1 -> (main_d2 + 1), main_d2 -> (main_d1old + 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 [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 [6 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 9, col: 1> | <line: 14, col: 9> <line: 15, col: 10> <line: 16, col: 10>
main | function | [integer, ()] | <line: 11, col: 1>
x | local variable | integer | <line: 13, col: 5> | <line: 14, col: 5> <line: 17, col: 9> <line: 18, col: 3> <line: 18, col: 7>
d1 | local variable | integer | <line: 13, col: 5> | <line: 15, col: 5> <line: 18, col: 11> <line: 19, col: 11> <line: 20, col: 3>
d2 | local variable | integer | <line: 13, col: 5> | <line: 16, col: 5> <line: 20, col: 8> <line: 21, col: 3>
d1old | local variable | integer | <line: 13, col: 5> | <line: 19, col: 3> <line: 21, col: 8>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_x = undef4) /\ (main_d1 = undef5) /\ (main_d2 = undef6)>
<l2, l2, (main_x >= 0), par{main_x -> (main_x - main_d1), main_d1 -> (main_d2 + 1), main_d2 -> (main_d1 + 1)}>
<l2, l6, not((main_x >= 0))>

Fresh variables:
undef4, undef5, undef6, 

Undef variables:
undef4, undef5, undef6, 

Abstraction variables:

Exit nodes:
6, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 0 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
Variables:
main_x, main_d1, main_d2

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_x = undef4 /\ main_d1 = undef5 /\ main_d2 = undef6, {all remain the same}>

Graph 2
<l2, l6, 1 + main_x <= 0, {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.002465

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000550s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001621s
[26013 : 26015]
[26013 : 26016]
Successful child: 26015
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 0 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 0 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + main_x <= 0 - Process 1
* Exit transition: <l0, l2, main_x = undef4 /\ main_d1 = undef5 /\ main_d2 = undef6, {all remain the same}>
* Postcondition  : 1 + main_x <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000654s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + main_x <= 0 , 
Narrowing transition: 
<l2, l2, 0 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
Variables:
main_x, main_d1, main_d2
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000509s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001725s
[26013 : 26020]
[26013 : 26021]
Successful child: 26020
[ 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, main_x <= main_d1 + main_d2 /\ 0 <= main_x /\ 1 + main_x <= main_d1, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, 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, main_x <= main_d1 + main_d2 /\ 0 <= main_x /\ 1 + main_x <= main_d1, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
Ranking function: main_x
New Graphs: 
[26013 : 26025]
[26013 : 26026]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x <= main_d1 + main_d2 , 1 + main_x <= main_d1 , 
Narrowing transition: 
<l2, l2, 0 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001215s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010933s
[26013 : 26027]
[26013 : 26028]
Successful child: 26028
Ranking function: 2*main_x - main_d1
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x /\ 1 + main_d1 + main_d2 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
Variables:
main_x, main_d1, main_d2
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000694s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002898s
[26013 : 26032]
[26013 : 26033]
Successful child: 26032
[ 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, main_x <= main_d1 + main_d2 /\ 0 <= main_x /\ main_d1 <= main_x /\ 0 <= main_d1 + main_d2 /\ 0 <= 320 + main_x + main_d2, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 0 <= main_d1 + main_d2 /\ 1 + main_d1 + main_d2 <= main_x /\ 0 <= 320 + main_x + main_d2, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, 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_x /\ 0 <= main_d1 + main_d2 /\ 1 + main_d1 + main_d2 <= main_x /\ 0 <= 320 + main_x + main_d2, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
Ranking function: 319 + 2*main_x - main_d1
New Graphs: 
[26013 : 26037]
[26013 : 26038]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= main_d1 + main_d2 , 0 <= 320 + main_x + main_d2 , 
It's unfeasible. Removing transition: 
<l2, l2, main_x <= main_d1 + main_d2 /\ 0 <= main_x /\ main_d1 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
Narrowing transition: 
<l2, l2, 0 <= main_x /\ 1 + main_d1 + main_d2 <= main_x, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= main_x /\ 0 <= main_d1 + main_d2 /\ 1 + main_d1 + main_d2 <= main_x /\ 321 + main_x + main_d2 <= 0, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 + main_d1 + main_d2 <= main_x /\ 1 + main_d1 + main_d2 <= 0, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
Variables:
main_x, main_d1, main_d2
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001878s
Ranking function: -1 - main_d1 - main_d2
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x /\ 0 <= main_d1 + main_d2 /\ 1 + main_d1 + main_d2 <= main_x /\ 321 + main_x + main_d2 <= 0, {main_x -> main_x - main_d1, main_d1 -> 1 + main_d2, main_d2 -> 1 + main_d1, rest remain the same}>
Variables:
main_x, main_d1, main_d2
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001094s
Ranking function: (~(321) / 323) + (~(1) / 323)*main_x + (~(1) / 323)*main_d2
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l6}...
No cycles found.

Program Terminates