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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿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_y), main_y -> (main_y + main_z), main_z -> (main_z + 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_y -> varCall_2}>
<l11, l12, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l12, l1, true, seq{main_z -> 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_y), main_y -> (main_y + main_z), main_z -> (main_z + 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 [5 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 8, col: 1> | <line: 13, col: 9> <line: 14, col: 9> <line: 15, col: 9>
main | function | [integer, ()] | <line: 10, col: 1>
x | local variable | integer | <line: 12, col: 5> | <line: 13, col: 5> <line: 16, col: 12> <line: 17, col: 9> <line: 17, col: 13>
y | local variable | integer | <line: 12, col: 5> | <line: 14, col: 5> <line: 17, col: 17> <line: 18, col: 9> <line: 18, col: 13>
z | local variable | integer | <line: 12, col: 5> | <line: 15, col: 5> <line: 18, col: 17> <line: 19, col: 9> <line: 19, col: 13>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_x = undef4) /\ (main_y = undef5) /\ (main_z = undef6)>
<l2, l2, (main_x > 0), par{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z + 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, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
Variables:
main_x, main_y, main_z

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l6, 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.002392

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000854s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002046s
[29753 : 29755]
[29753 : 29756]
Successful child: 29755
[ 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, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000825s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002174s
[29753 : 29760]
[29753 : 29761]
Successful child: 29760
[ 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, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + 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
It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000827s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002182s
[29753 : 29765]
[29753 : 29766]
Successful child: 29765
[ 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_y + main_z <= 0 /\ 0 <= main_z /\ 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + 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): 
<l2, l2, main_x + main_y + main_z <= 0 /\ 0 <= main_z /\ 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
Ranking function: -main_y - main_z
New Graphs: 
[29753 : 29770]
[29753 : 29771]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x + main_y + main_z <= 0 , 0 <= main_z , 
Narrowing transition: 
<l2, l2, 1 <= main_x, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>

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

LOG: CALL solveLinear

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000639s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002393s
[29753 : 29772]
[29753 : 29773]
Successful child: 29772
[ 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_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000588s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x + main_y + main_z <= 0 , 
It's unfeasible. Removing transition: 
<l2, l2, main_x + main_y + main_z <= 0 /\ 1 <= main_x /\ 1 + main_z <= 0, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
Narrowing transition: 
<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000665s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002383s
[29753 : 29777]
[29753 : 29778]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019787s
Time used: 0.019781

LOG: SAT solveNonLinear - Elapsed time: 0.031051s
Cost: 1; Total time: 0.030535
Quasi-ranking function: 50000 - main_z
New Graphs: 
Transitions:
<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
Variables:
main_x, main_y, main_z
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000706s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003251s
[29753 : 29924]
[29753 : 29925]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014144s
Time used: 0.014139

LOG: SAT solveNonLinear - Elapsed time: 0.025910s
Cost: 1; Total time: 0.025412
Quasi-ranking function: 50000 - main_y
New Graphs: 
Transitions:
<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 50001 <= main_y /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
Variables:
main_x, main_y, main_z
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000797s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011420s
[29753 : 29929]
[29753 : 29930]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017298s
Time used: 0.017292

LOG: SAT solveNonLinear - Elapsed time: 0.029409s
Cost: 1; Total time: 0.02881
Quasi-ranking function: 50000 - main_x + main_z
New Graphs: 
Transitions:
<l2, l2, 1 <= main_x /\ 1 <= main_x + main_y + main_z /\ 50001 + main_z <= main_x /\ 50001 <= main_y /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
Variables:
main_x, main_y, main_z
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000877s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006278s
[29753 : 29934]
[29753 : 29935]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020567s
Time used: 0.020562

LOG: SAT solveNonLinear - Elapsed time: 0.034777s
Cost: 1; Total time: 0.034141
Quasi-ranking function: 50000 - main_x
New Graphs: 
Transitions:
<l2, l2, 1 <= main_x + main_y + main_z /\ 50001 <= main_x /\ 50001 + main_z <= main_x /\ 50001 <= main_y /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
Variables:
main_x, main_y, main_z
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001185s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005702s
[29753 : 29939]
[29753 : 29940]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018241s
Time used: 0.018235

LOG: SAT solveNonLinear - Elapsed time: 0.031310s
Cost: 1; Total time: 0.03062
Quasi-ranking function: 50000 - main_x - main_y + main_z
New Graphs: 
Transitions:
<l2, l2, 1 <= main_x + main_y + main_z /\ 50001 <= main_x /\ 50001 + main_z <= main_x + main_y /\ 50001 + main_z <= main_x /\ 50001 <= main_y /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
Variables:
main_x, main_y, main_z
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000990s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.021339s
[29753 : 29944]
[29753 : 29945]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032156s
Time used: 0.03215

LOG: SAT solveNonLinear - Elapsed time: 0.043751s
Cost: 1; Total time: 0.043101
Quasi-ranking function: 50000 - main_x - main_y - main_z
New Graphs: 
Transitions:
<l2, l2, 50001 <= main_x /\ 50001 + main_z <= main_x + main_y /\ 50001 <= main_x + main_y + main_z /\ 50001 + main_z <= main_x /\ 50001 <= main_y /\ 50001 <= main_z, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}>
Variables:
main_x, main_y, main_z
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001001s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.020787s
[29753 : 29949]
[29753 : 29950]
Timeout expired!

[29753 : 29954]
[29753 : 29958]
Successful child: 29954

Program does NOT terminate