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_c -> ¿functionCall(__VERIFIER_nondet_int), main_x -> ¿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_c)}>
<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_c -> varCall_1}>
<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l10, l1, true, seq{main_x -> varCall_2}>
<l1, l2, true>
<l2, l3, (main_x >= 0)>
<l2, l5, not((main_x >= 0))>
<l3, l4, true, seq{main_x -> (main_x + main_c)}>
<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 [4 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 10, col: 1> | <line: 15, col: 9> <line: 16, col: 6>
main | function | [integer, ()] | <line: 12, col: 1>
c | local variable | integer | <line: 14, col: 2> | <line: 15, col: 5> <line: 18, col: 11>
x | local variable | integer | <line: 14, col: 2> | <line: 16, col: 2> <line: 17, col: 9> <line: 18, col: 3> <line: 18, col: 7>

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

Fresh variables:
undef3, undef4, 

Undef variables:
undef3, undef4, 

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_c + main_x, rest remain the same}>
Variables:
main_c, main_x

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_c = undef3 /\ main_x = undef4, {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.001972

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000842s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001380s
[46724 : 46726]
[46724 : 46727]
Successful child: 46726
[ 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_x /\ 1 + main_c <= 0, {main_x -> main_c + main_x, 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 /\ 1 + main_c <= 0, {main_x -> main_c + main_x, rest remain the same}>
Ranking function: main_x
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000516s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001617s
[46724 : 46732]
[46724 : 46733]
Successful child: 46732
[ 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_c /\ 0 <= main_x, {main_x -> main_c + main_x, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 0 <= main_c /\ 0 <= main_x, {main_x -> main_c + main_x, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000604s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001948s
[46724 : 46737]
[46724 : 46738]
Successful child: 46737
[ 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_c /\ 0 <= main_c + main_x /\ 0 <= main_x, {main_x -> main_c + main_x, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 0 <= main_c /\ 0 <= main_c + main_x /\ 0 <= main_x, {main_x -> main_c + main_x, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000620s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001942s
[46724 : 46742]
[46724 : 46743]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005300s
Time used: 0.004975

[46724 : 46747]
[46724 : 46751]
Successful child: 46751

Program does NOT terminate