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_z), main_z -> (~(2) * main_y), main_y -> (main_y + 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_z), main_z -> (~(2) * main_y), main_y -> (main_y + 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: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 26, col: 9>
main | function | [integer, ()] | <line: 22, col: 1>
x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 27, col: 12> <line: 28, col: 9> <line: 28, col: 13>
y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 29, col: 16> <line: 30, col: 9> <line: 30, col: 13>
z | local variable | integer | <line: 23, col: 5> | <line: 26, col: 5> <line: 28, col: 17> <line: 29, col: 9>

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_z), main_y -> (main_y + 1), main_z -> (~(2) * main_y)}>
<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 <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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, 0 <= main_x, {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.002655

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000843s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001997s
[3523 : 3525]
[3523 : 3526]
Successful child: 3525
[ 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 <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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 <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.000807s

LOG: CALL solveLinear

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

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.000800s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002127s
[3523 : 3535]
[3523 : 3536]
Successful child: 3535
[ 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 + main_z /\ 1 + main_x <= 0 /\ main_y <= 1 + main_x, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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 + main_z /\ 1 + main_x <= 0 /\ main_y <= 1 + main_x, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
Ranking function: -main_x
New Graphs: 
[3523 : 3540]
[3523 : 3541]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= main_x + main_z , main_y <= 1 + main_x , 
Narrowing transition: 
<l2, l2, 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001184s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007951s
Piecewise ranking function: min(2,1 - main_x)
New Graphs: 
Transitions:
<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.000603s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002041s
[3523 : 3542]
[3523 : 3543]
Successful child: 3542
[ 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_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, main_y <= main_x /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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_y <= main_x /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
Ranking function: -main_y
New Graphs: 
[3523 : 3547]
[3523 : 3548]
[3523 : 3549]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_y <= main_x , 1 <= main_z , 
Narrowing transition: 
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.002305s
Ranking function: 2 - 2*main_y
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001236s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011484s
Piecewise ranking function: min(0,-1 - main_x)
New Graphs: 
Transitions:
<l2, l2, 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.000714s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002453s
[3523 : 3550]
[3523 : 3551]
Successful child: 3550
[ 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, 2*main_y <= 2*main_x + main_z /\ 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 2*main_y <= 2*main_x + main_z /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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, 2*main_y <= 2*main_x + main_z /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
Ranking function: 90 - main_x + main_y
New Graphs: 
[3523 : 3555]
[3523 : 3556]
[3523 : 3557]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 2*main_y <= 2*main_x + main_z , 
Narrowing transition: 
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.003083s
Ranking function: -6 - 6*main_y
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001501s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.029499s
Piecewise ranking function: min(0,-1 - main_x)
New Graphs: 
Transitions:
<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.000850s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003842s
[3523 : 3558]
[3523 : 3559]
Successful child: 3558
[ 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_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z /\ 1 + main_x = main_y, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z /\ 1 + main_x = main_y, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
Ranking function: 2 - main_x
New Graphs: 
[3523 : 3563]
[3523 : 3564]
[3523 : 3565]
[3523 : 3566]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 <= main_z , main_y <= 1 + main_x , 
Narrowing transition: 
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.003789s
Ranking function: 4 - 4*main_y
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.002307s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.060881s
Piecewise ranking function: min(-main_x,1)
New Graphs: 
Transitions:
<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001611s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016118s
[3523 : 3567]
[3523 : 3568]
Successful child: 3567
[ 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 + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
Ranking function: main_z
New Graphs: 
Transitions:
<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001021s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005374s
[3523 : 3572]
[3523 : 3573]
Successful child: 3572
[ 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 + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z /\ 2*main_y <= 1 + main_x, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
New Graphs: 
[3523 : 3577]
[3523 : 3578]
[3523 : 3579]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 <= 2*main_y + main_z , 
[3523 : 3580]
[3523 : 3581]
[3523 : 3582]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 2*main_y <= 1 + main_x , 
Narrowing transition: 
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, main_y <= main_x /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_y <= main_x /\ 2*main_y + main_z <= 0 /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 2*main_y + main_z <= 0 /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 2*main_y + main_z <= 0 /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.007109s
Ranking function: 4 - 8*main_y
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x + main_z /\ 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 2*main_y + main_z <= 0 /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.003962s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.363703s
Piecewise ranking function: min(0,-1 - main_x)
New Graphs: 
Transitions:
<l2, l2, 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, 2*main_y + main_z <= 0 /\ main_z <= 0 /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.003121s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.092002s
[3523 : 3583]
[3523 : 3584]
Successful child: 3584
Ranking function: -2*main_y - main_z
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, 2 + main_x <= 2*main_y /\ 2 + main_x <= main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 1 <= main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}>
<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.003517s
Ranking function: -1 + main_z
New Graphs: 
Transitions:
<l2, l2, main_z <= 0 /\ 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001094s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005084s
[3523 : 3588]
[3523 : 3589]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.084058s
Time used: 0.084056

LOG: SAT solveNonLinear - Elapsed time: 0.133396s
Cost: 1; Total time: 0.13245
Quasi-ranking function: 50000 + main_z
New Graphs: 
Transitions:
<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001245s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013250s
[3523 : 3594]
[3523 : 3595]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.070285s
Time used: 0.070282

LOG: SAT solveNonLinear - Elapsed time: 0.125299s
Cost: 1; Total time: 0.123977
Quasi-ranking function: 50000 + main_x + main_y + main_z
New Graphs: 
Transitions:
<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001314s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.059589s
[3523 : 3599]
[3523 : 3600]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.086861s
Time used: 0.08686

LOG: SAT solveNonLinear - Elapsed time: 0.141270s
Cost: 1; Total time: 0.139989
Quasi-ranking function: 50000 + main_y + 2*main_z
New Graphs: 
Transitions:
<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001458s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.094457s
[3523 : 3604]
[3523 : 3605]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.066656s
Time used: 0.066623

LOG: SAT solveNonLinear - Elapsed time: 0.114013s
Cost: 1; Total time: 0.112651
Quasi-ranking function: 50000 + main_x - main_y + main_z
New Graphs: 
Transitions:
<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001506s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.115389s
[3523 : 3609]
[3523 : 3610]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.071612s
Time used: 0.071611

LOG: SAT solveNonLinear - Elapsed time: 0.127010s
Cost: 1; Total time: 0.12565
Quasi-ranking function: 50000 - main_y
New Graphs: 
Transitions:
<l2, l2, 2 + main_x <= 2*main_y /\ 1 + 2*main_x + main_z <= 2*main_y /\ 1 + main_x <= 0 /\ 1 + main_x <= main_y /\ 1 + main_x + main_z <= 0 /\ 1 <= 2*main_y + main_z /\ 50001 + main_x + main_y + main_z <= 0 /\ 50001 + main_x + main_z <= main_y /\ 50001 + main_y + 2*main_z <= 0 /\ 50001 <= main_y /\ 50001 + main_z <= 0, {main_x -> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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.001536s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.137136s
[3523 : 3614]
[3523 : 3615]
Timeout expired!

[3523 : 3619]
[3523 : 3623]
Successful child: 3619

Program does NOT terminate