NO

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)}>
<l1, l2, (main_x > ¿functionCall(__VERIFIER_nondet_int))>
<l1, l7, not((main_x > ¿functionCall(__VERIFIER_nondet_int)))>
<l2, l3, true>
<l3, l6, (main_x = 0)>
<l3, l4, not((main_x = 0))>
<l4, l5, true, seq{main_x -> (main_x - 1)}>
<l5, l3, true>
<l6, l7, true>
<l7, l8, 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, l9, true, seq{main__func_return_ -> 0}>
<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l10, l1, true, seq{main_x -> varCall_1}>
<l1, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l11, l2, (main_x > varCall_2)>
<l11, l7, not((main_x > varCall_2))>
<l2, l3, true>
<l3, l6, (main_x = 0)>
<l3, l4, not((main_x = 0))>
<l4, l5, true, seq{main_x -> (main_x - 1)}>
<l5, l3, true>
<l6, l7, true>
<l7, l8, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

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

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (main_x = undef3) /\ (undef3 > undef4)>
<l0, l8, (main_x = undef3) /\ not((undef3 > undef4))>
<l3, l8, (main_x = 0)>
<l3, l3, (main_x < 0), par{main_x -> (main_x - 1)}>
<l3, l3, (main_x > 0), par{main_x -> (main_x - 1)}>

Fresh variables:
undef3, undef4, 

Undef variables:
undef3, undef4, 

Abstraction variables:

Exit nodes:
8, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 + undef4 <= undef3 /\ main_x = undef3, {all remain the same}>

Graph 2
<l0, l8, undef3 <= undef4 /\ main_x = undef3, {all remain the same}>
<l3, l8, main_x = 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 3 , 1 )
( 8 , 2 )

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000416s
Ranking function: -1 + main_x
New Graphs: 
Transitions:
<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
Variables:
main_x
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000198s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000582s
[2417 : 2419]
[2417 : 2420]
Successful child: 2419
[ 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: 
<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 <= main_x, {main_x -> -1 + 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
It's unfeasible. Removing transition: 
<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l3, l3, 1 <= main_x, {main_x -> -1 + main_x, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
Variables:
main_x
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000299s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000840s
[2417 : 2424]
[2417 : 2425]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002261s
Time used: 0.002103
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007003s
Time used: 0.007001

LOG: SAT solveNonLinear - Elapsed time: 0.009264s
Cost: 1; Total time: 0.009104
Quasi-ranking function: 50000 + main_x
New Graphs: 
Transitions:
<l3, l3, 50001 + main_x <= 0, {main_x -> -1 + main_x, rest remain the same}>
Variables:
main_x
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000198s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000566s
[2417 : 2429]
[2417 : 2430]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009258s
Time used: 0.008778

[2417 : 2434]
[2417 : 2438]
Successful child: 2434

Program does NOT terminate