/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

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), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l10, not((main_x >= 0))>
<l2, l3, (main_x >= 0)>
<l3, l4, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
<l3, l6, (¿functionCall(__VERIFIER_nondet_int) = 0)>
<l4, l5, true, seq{main_x -> (main_x + main_y)}>
<l5, l8, true>
<l6, l7, true, seq{main_x -> (main_x + main_z)}>
<l7, l8, true>
<l8, l9, true, seq{main_y -> (main_y + main_z), main_z -> (main_z - 1)}>
<l9, l2, true>
<l10, l11, 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, l12, true, seq{main__func_return_ -> 0}>
<l12, l13, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l13, l14, true, seq{main_x -> varCall_1}>
<l14, l15, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l15, l16, true, seq{main_y -> varCall_2}>
<l16, l17, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l17, l1, true, seq{main_z -> varCall_3}>
<l1, l2, true>
<l2, l3, (main_x >= 0)>
<l2, l10, not((main_x >= 0))>
<l3, l18, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l18, l6, (varCall_4 = 0)>
<l18, l4, (varCall_4 = 1)>
<l4, l5, true, seq{main_x -> (main_x + main_y)}>
<l5, l8, true>
<l6, l7, true, seq{main_x -> (main_x + main_z)}>
<l7, l8, true>
<l8, l9, true, seq{main_y -> (main_y + main_z), main_z -> (main_z - 1)}>
<l9, l2, true>
<l10, l11, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
11, 
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: 15, col: 1> | <line: 20, col: 9> <line: 21, col: 9> <line: 22, col: 9> <line: 24, col: 7>
main | function | [integer, ()] | <line: 17, col: 1>
x | local variable | integer | <line: 19, col: 5> | <line: 20, col: 5> <line: 23, col: 9> <line: 25, col: 4> <line: 25, col: 8> <line: 27, col: 4> <line: 27, col: 8>
y | local variable | integer | <line: 19, col: 5> | <line: 21, col: 5> <line: 25, col: 12> <line: 29, col: 3> <line: 29, col: 7>
z | local variable | integer | <line: 19, col: 5> | <line: 22, col: 5> <line: 27, col: 12> <line: 29, col: 11> <line: 30, col: 3> <line: 30, col: 7>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_x = undef5) /\ (main_y = undef6) /\ (main_z = undef7)>
<l2, l2, (main_x >= 0) /\ (undef8 = 0), par{main_x -> (main_x + main_z), main_y -> (main_y + main_z), main_z -> (main_z - 1)}>
<l2, l2, (main_x >= 0) /\ (undef8 = 1), par{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z - 1)}>
<l2, l11, not((main_x >= 0))>

Fresh variables:
undef5, undef6, undef7, undef8, 

Undef variables:
undef5, undef6, undef7, undef8, 

Abstraction variables:

Exit nodes:
11, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 0 <= main_x /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ undef8 = 1, {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 = undef5 /\ main_y = undef6 /\ main_z = undef7, {all remain the same}>

Graph 2
<l2, l11, 1 + main_x <= 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 11 , 2 )

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001175s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003195s
[60050 : 60051]
[60050 : 60052]
Successful child: 60051
[ 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 /\ undef8 = 0, {main_x -> main_x + main_z, 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, 0 <= main_x /\ undef8 = 1, {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, 0 <= main_x /\ undef8 = 1, {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, 0 <= main_x /\ undef8 = 0, {main_x -> main_x + main_z, 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 = undef5 /\ main_y = undef6 /\ main_z = undef7, {all remain the same}>
* Postcondition  : 1 + main_x <= 0

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003417s
[60050 : 60056]
[60050 : 60057]
Successful child: 60056
[ 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_z <= 0 /\ 0 <= main_x /\ 1 + main_x + main_y <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 + main_x + main_y <= 0 /\ undef8 = 1, {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_z <= 0 /\ 0 <= main_x /\ 1 + main_x + main_y <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 + main_x + main_y <= 0 /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
Ranking function: main_x
New Graphs: 
Transitions:
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 + main_x + main_y <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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.000717s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002698s
[60050 : 60064]
[60050 : 60065]
Successful child: 60064
[ 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_z <= 0 /\ 0 <= main_x /\ 1 + main_x + main_y <= 0 /\ 1 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 + main_x + main_y <= 0 /\ 1 + main_z <= 0 /\ undef8 = 1, {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_z <= 0 /\ 0 <= main_x /\ 1 + main_x + main_y <= 0 /\ 1 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
Ranking function: main_x
New Graphs: 
[60050 : 60097]
[60050 : 60098]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x + main_z <= 0 , 1 + main_x + main_y <= 0 , 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.020876s
[60050 : 60105]
[60050 : 60106]
Successful child: 60105
[ 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_z <= 0 /\ 0 <= main_x /\ 0 <= main_z /\ 1 + main_x + main_y <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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, 0 <= main_x /\ 1 <= main_x + main_z /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 0 <= main_z /\ 1 + main_x + main_y <= 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 1, {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, 0 <= main_x /\ 1 <= main_x + main_z /\ undef8 = 1, {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, 0 <= main_x /\ 1 <= main_x + main_z /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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, 0 <= main_x /\ 1 <= main_x + main_z /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 1, {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.001347s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005949s
[60050 : 60224]
[60050 : 60225]
Successful child: 60224
[ 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_z <= 0 /\ 0 <= main_x /\ 0 <= main_z /\ 1 + main_x + main_y <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 0 <= main_z /\ 1 + main_x + main_y <= 0 /\ undef8 = 1, {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, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 1, {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, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
New Graphs: 
[60050 : 60229]
[60050 : 60230]
[60050 : 60231]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x + main_y <= 0 , main_x + main_z <= 0 , 
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + main_x + main_y <= 0 , 
It's unfeasible. Removing transition: 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 0 <= main_z /\ 1 + main_x + main_y <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
Narrowing transition: 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 0 <= main_x + main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>

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

LOG: Narrow transition size 3
It's unfeasible. Removing transition: 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 0 <= main_z /\ 1 + main_x + main_y <= 0 /\ undef8 = 1, {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, main_x + main_z <= 0 /\ 0 <= main_x /\ 0 <= main_x + main_y /\ undef8 = 1, {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 3
Narrowing transition: 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_z /\ undef8 = 1, {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 3
invGraph after Narrowing: 
Transitions:
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ undef8 = 1, {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.005846s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.230724s
[60050 : 60232]
[60050 : 60233]
Successful child: 60232
[ 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_z <= 0 /\ 0 <= main_x /\ 2 + main_z <= 0 /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 2 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 2 + main_z <= 0 /\ main_x + main_y = 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 2 + main_z <= 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 1, {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_z <= 0 /\ 0 <= main_x /\ 2 + main_z <= 0 /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 2 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 2 + main_z <= 0 /\ main_x + main_y = 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 2 + main_z <= 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
Ranking function: 3 + 2*main_y - 3*main_z
New Graphs: 
Transitions:
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ undef8 = 1, {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.003425s

LOG: CALL solveLinear

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

LOG: CALL solveLinear

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.025737s
[60050 : 60242]
[60050 : 60243]
Successful child: 60242
[ 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_z <= 0 /\ 0 <= main_x /\ 2 + main_z <= 0 /\ main_y <= 2 /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 2 + main_z <= 0 /\ main_y <= 2 /\ main_x + main_y = 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 1, {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, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
Ranking function: main_x + main_y
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 1, {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.001042s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004627s
[60050 : 60247]
[60050 : 60248]
Successful child: 60247
[ 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_z <= 0 /\ 0 <= main_x /\ 2 + main_z <= 0 /\ main_y <= 2 /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 0, {main_x -> main_x + main_z, 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, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 2 + main_z <= 0 /\ main_y <= 2 /\ main_x + main_y = 0 /\ undef8 = 1, {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, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 1, {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, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 1, {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, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 2 + main_z <= 0 /\ main_y <= 2 /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
New Graphs: 
[60050 : 60252]
[60050 : 60253]
[60050 : 60254]
[60050 : 60255]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 2 + main_z <= 0 , 
[60050 : 60256]
[60050 : 60257]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_y <= 2 , 
[60050 : 60258]
[60050 : 60259]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x + main_y <= 0 , 
Narrowing transition: 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>

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

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.039873s
[60050 : 60260]
[60050 : 60261]
Successful child: 60260
[ 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_z <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 0 <= 1 + main_z /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_z /\ 0 <= 1 + main_z /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 0 <= 1 + main_z /\ main_x + main_y = 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_z /\ 0 <= 1 + main_z /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ undef8 = 1, {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_z <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
Ranking function: 2 + 2*main_x + main_y + main_z
New Graphs: 
Transitions:
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ main_z <= 0 /\ 1 <= main_x + main_y /\ undef8 = 1, {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.002824s
Ranking function: (~(1) / 2) + (1 / 2)*main_x + (1 / 2)*main_y
New Graphs: 
[60050 : 60265]
[60050 : 60266]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_y <= 0 , main_z <= 0 , 
It's unfeasible. Removing transition: 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 0 <= 1 + main_z /\ main_x + main_y = 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
Narrowing transition: 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>

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

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

LOG: Narrow transition size 2
It's unfeasible. Removing transition: 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 0 <= 1 + main_z /\ main_x + main_y = 0 /\ undef8 = 1, {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, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ undef8 = 1, {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
Narrowing transition: 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_z /\ 0 <= 1 + main_z /\ undef8 = 1, {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
Narrowing transition: 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ undef8 = 1, {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_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ undef8 = 1, {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.008988s
Ranking function: -3 + 3*main_z
New Graphs: 
Transitions:
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ undef8 = 1, {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.002936s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.033595s
[60050 : 60267]
[60050 : 60268]
Successful child: 60267
[ 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_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 0, {main_x -> main_x + main_z, 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, 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 1, {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, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 1, {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, 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 1, {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_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, 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
Strengthening transition (result): 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 1, {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
Strengthening transition (result): 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
Ranking function: 2 - main_x + 2*main_y - main_z
New Graphs: 
Transitions:
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ 1 + main_z <= 0 /\ undef8 = 1, {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.003847s
Ranking function: -1 + main_y
New Graphs: 
[60050 : 60272]
[60050 : 60273]
[60050 : 60274]
[60050 : 60275]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + main_z <= 0 , 
It's unfeasible. Removing transition: 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
Narrowing transition: 
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>

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

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

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l2, l2, main_x + main_z <= 0 /\ 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_y /\ undef8 = 1, {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, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 1, {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
Narrowing transition: 
<l2, l2, 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 1, {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
Narrowing transition: 
<l2, l2, 0 <= main_x /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ undef8 = 1, {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, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 0 <= main_z /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, main_x + main_y <= 0 /\ 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ main_y <= 0 /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_z /\ undef8 = 1, {main_x -> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 0 <= main_z /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ undef8 = 1, {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.007476s
Ranking function: -3*main_y
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x /\ 0 <= main_z /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ undef8 = 0, {main_x -> main_x + main_z, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}>
<l2, l2, 0 <= main_x /\ 0 <= main_z /\ 1 <= main_x + main_y /\ 1 <= main_x + main_z /\ 1 <= main_y /\ undef8 = 1, {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.002960s
Ranking function: main_z
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l11}...
No cycles found.

Program Terminates