NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
*******************************************************************************************
*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
*******************************************************************************************


List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :

+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
+                                                                  +
Init Location: 0
Transitions:
<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l19, (main_y = 0)>
<l2, l3, not((main_y = 0))>
<l3, l4, true, seq{main_tmp -> main_y, main_xtmp -> main_x}>
<l4, l6, (main_x <= 0)>
<l4, l5, not((main_x <= 0))>
<l5, l6, (main_y <= 0)>
<l5, l8, not((main_y <= 0))>
<l6, l7, true, seq{main_y -> 0}>
<l7, l17, true>
<l8, l9, (main_x = main_y)>
<l8, l11, not((main_x = main_y))>
<l9, l10, true, seq{main_y -> 0}>
<l10, l16, true>
<l11, l12, true>
<l12, l15, not((main_xtmp > main_y))>
<l12, l13, (main_xtmp > main_y)>
<l13, l14, true, seq{main_xtmp -> (main_xtmp - main_y)}>
<l14, l12, true>
<l15, l16, true>
<l16, l17, true>
<l17, l18, true, seq{main_y -> main_xtmp, main_x -> main_tmp}>
<l18, l2, true>
<l19, l20, 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, l21, true, seq{main__func_return_ -> 0}>
<l21, l22, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l22, l23, true, seq{main_x -> varCall_1}>
<l23, l24, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l24, l1, true, seq{main_y -> varCall_2}>
<l1, l2, true>
<l2, l19, (main_y = 0)>
<l2, l3, not((main_y = 0))>
<l3, l4, true, seq{main_tmp -> main_y, main_xtmp -> main_x}>
<l4, l6, (main_x <= 0)>
<l4, l5, not((main_x <= 0))>
<l5, l6, (main_y <= 0)>
<l5, l8, not((main_y <= 0))>
<l6, l7, true, seq{main_y -> 0}>
<l7, l17, true>
<l8, l9, (main_x = main_y)>
<l8, l11, not((main_x = main_y))>
<l9, l10, true, seq{main_y -> 0}>
<l10, l16, true>
<l11, l12, true>
<l12, l13, (main_xtmp > main_y)>
<l12, l15, not((main_xtmp > main_y))>
<l13, l14, true, seq{main_xtmp -> (main_xtmp - main_y)}>
<l14, l12, true>
<l15, l16, true>
<l16, l17, true>
<l17, l18, true, seq{main_y -> main_xtmp, main_x -> main_tmp}>
<l18, l2, true>
<l19, l20, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
20, 
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 [6 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 10, col: 9> <line: 11, col: 9>
main | function | [integer, ()] | <line: 5, col: 1>
x | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 15, col: 16> <line: 17, col: 12> <line: 20, col: 17> <line: 30, col: 9>
y | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 13, col: 11> <line: 14, col: 15> <line: 17, col: 22> <line: 18, col: 13> <line: 20, col: 22> <line: 21, col: 17> <line: 23, col: 28> <line: 24, col: 35> <line: 29, col: 9>
tmp | local variable | integer | <line: 8, col: 5> | <line: 14, col: 9> <line: 30, col: 13>
xtmp | local variable | integer | <line: 9, col: 5> | <line: 15, col: 9> <line: 23, col: 23> <line: 24, col: 21> <line: 24, col: 28> <line: 29, col: 13>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
<l2, l20, (main_y = 0)>
<l2, l2, (main_y < 0) /\ (main_x <= 0), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}>
<l2, l2, (main_y < 0) /\ not((main_x <= 0)) /\ (main_y <= 0), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}>
<l2, l2, (main_y > 0) /\ (main_x <= 0), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}>
<l2, l2, (main_y > 0) /\ not((main_x <= 0)) /\ not((main_y <= 0)) /\ (main_x = main_y), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}>
<l2, l12, (main_y > 0) /\ not((main_x <= 0)) /\ not((main_y <= 0)) /\ (main_x < main_y), par{main_tmp -> main_y, main_xtmp -> main_x}>
<l2, l12, (main_y > 0) /\ not((main_x <= 0)) /\ not((main_y <= 0)) /\ (main_x > main_y), par{main_tmp -> main_y, main_xtmp -> main_x}>
<l12, l12, (main_xtmp > main_y), par{main_xtmp -> (main_xtmp - main_y)}>
<l12, l2, not((main_xtmp > main_y)), par{main_x -> main_tmp, main_y -> main_xtmp}>

Fresh variables:
undef3, undef4, 

Undef variables:
undef3, undef4, 

Abstraction variables:

Exit nodes:
20, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, main_x <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ 1 <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l12, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l12, 1 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l12, l12, 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
<l12, l2, main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l20, main_y = 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 12 , 1 )
( 20 , 2 )

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

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

Checking conditional termination of SCC {l2, l12}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002434s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019178s
[29016 : 29018]
[29016 : 29019]
Successful child: 29018
[ 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 <= 0 /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l12, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l12, 1 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, main_y + main_tmp <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l12, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l12, 1 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, main_y + main_tmp <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l2, main_y + main_tmp <= 0 /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
New Graphs: 
Transitions:
<l12, l12, main_y + main_tmp <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
Variables:
main_y, main_tmp, main_xtmp
Transitions:
<l2, l2, main_x <= 0 /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp
Checking conditional termination of SCC {l12}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000330s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001041s
[29016 : 29023]
[29016 : 29024]
Successful child: 29023
[ 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: 
<l12, l12, main_y + main_tmp <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l12, l2, main_y + main_tmp <= 0 /\ main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l12, l12, main_y + main_tmp <= 0 /\ 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, main_x <= 0 /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001084s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019361s
[29016 : 29028]
[29016 : 29029]
Successful child: 29028
[ 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, main_x <= 0 /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, main_x <= 0 /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x + main_y /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000859s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007526s
[29016 : 29033]
[29016 : 29034]
Successful child: 29033
[ 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_y /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 0 <= main_x + main_y /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000872s
INVARIANTS: 
2: 
12: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x + main_y <= 1 , 
12: main_y + main_tmp <= 0 , 
INVARIANTS: 
12: 1 <= main_y + main_tmp , 
Quasi-INVARIANTS to narrow Graph: 
12: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000775s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= main_x + main_y , 
[29016 : 29038]
[29016 : 29039]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= main_y , 1 + main_y <= main_x , 
Narrowing transition: 
<l2, l2, main_x <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

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

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

LOG: Narrow transition size 4
Narrowing transition: 
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: Narrow transition size 4
Narrowing transition: 
<l2, l12, 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: Narrow transition size 4
Narrowing transition: 
<l2, l12, 1 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: Narrow transition size 4
Narrowing transition: 
<l12, l12, 1 + main_y <= main_xtmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l12, l2, main_xtmp <= main_y, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003518s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.071619s
[29016 : 29040]
[29016 : 29041]
Successful child: 29040
[ 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 <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l12, 0 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l12, 1 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y /\ 2 <= main_x + main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l12, l12, 1 + main_y <= main_xtmp /\ 1 <= main_y + main_tmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l2, main_xtmp <= main_y /\ 1 <= main_y + main_tmp /\ main_tmp + main_xtmp <= 1, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l12, l12, 1 + main_y <= main_xtmp /\ 1 <= main_y + main_tmp, {main_xtmp -> -main_y + main_xtmp, 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 <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l12, 0 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l12, 1 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y /\ 2 <= main_x + main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l2, main_xtmp <= main_y /\ 1 <= main_y + main_tmp /\ main_tmp + main_xtmp <= 1, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 0 <= main_x + main_y /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 1 + main_x + main_y <= 0 /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ main_x <= main_y /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001425s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.057032s
[29016 : 29045]
[29016 : 29046]
Successful child: 29045
[ 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, main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_x + main_y <= 0 /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ main_x <= main_y /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l12, l2, main_xtmp <= main_y /\ 1 <= main_y + main_tmp /\ main_tmp + main_xtmp <= 1, {main_x -> main_tmp, main_y -> main_xtmp, 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 <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_x + main_y <= 0 /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ main_x <= main_y /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x + main_y /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ main_x <= main_y /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000840s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006364s
[29016 : 29050]
[29016 : 29051]
Successful child: 29050
[ 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_y /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ main_x <= main_y /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ main_y <= 1 + main_x, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 0 <= main_x + main_y /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ main_x <= main_y /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ main_y <= 1 + main_x, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, main_x <= 0 /\ main_x <= main_y /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ main_y <= 1 + main_x, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001043s
Ranking function: -main_x
New Graphs: 
[29016 : 29055]
[29016 : 29056]
[29016 : 29057]
INVARIANTS: 
2: 
12: 
Quasi-INVARIANTS to narrow Graph: 
2: main_x + main_y <= 1 , 
12: main_tmp + main_xtmp <= 1 , 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000979s
INVARIANTS: 
2: 
12: 1 + main_y + main_tmp <= 0 , 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= main_x + main_y , 
12: 
[29016 : 29058]
[29016 : 29059]
[29016 : 29060]
[29016 : 29061]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= main_y , main_y <= 1 + main_x , 
Narrowing transition: 
<l2, l2, main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

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

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

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

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

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

LOG: Narrow transition size 4
It's unfeasible. Removing transition: 
<l2, l12, 0 <= main_x + main_y /\ 1 + main_x <= main_y /\ 1 <= main_x /\ 1 <= main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
It's unfeasible. Removing transition: 
<l2, l12, 1 <= main_x /\ 1 + main_y <= main_x /\ 1 <= main_y /\ 2 <= main_x + main_y, {main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
It's unfeasible. Removing transition: 
<l12, l12, 1 + main_y <= main_xtmp /\ 1 <= main_y + main_tmp, {main_xtmp -> -main_y + main_xtmp, rest remain the same}>
It's unfeasible. Removing transition: 
<l12, l2, main_xtmp <= main_y /\ 1 <= main_y + main_tmp, {main_x -> main_tmp, main_y -> main_xtmp, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l2, l2, main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 0 <= main_x + main_y /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 1 + main_x + main_y <= 0 /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ 2 + main_x <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ main_x <= main_y /\ 1 <= main_y /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 <= main_x + main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002028s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.135276s
[29016 : 29062]
[29016 : 29063]
Successful child: 29062
[ 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, main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_x + main_y <= 0 /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ 2 + main_x <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ main_x <= main_y /\ 1 <= main_y /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 <= main_x + main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, main_x <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_x + main_y <= 0 /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ 2 + main_x <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ main_x <= main_y /\ 1 <= main_y /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 1 + main_x + main_y <= 0 /\ 1 <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 <= main_x + main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x + main_y /\ 1 <= main_x /\ 1 + main_y <= 0, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ 2 + main_x <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ main_x <= main_y /\ 1 <= main_y /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 <= main_x + main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001292s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.017251s
[29016 : 29067]
[29016 : 29068]
Successful child: 29067
[ 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_y /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ 2 + main_x <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ main_x <= main_y /\ 1 <= main_y /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 <= main_x + main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, main_x <= 0 /\ main_x <= main_y /\ 1 <= main_y /\ 2 <= main_x + main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, 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 <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ 2 + main_x <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 2 <= main_x + main_y /\ main_x = main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 0 <= main_x + main_y /\ 1 <= main_x /\ 1 + main_y <= 0 /\ main_x + main_y <= 1, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
<l2, l2, main_x <= 0 /\ 0 <= main_x + main_y /\ 1 <= main_y /\ main_x + main_y <= 1 /\ 2 + main_x <= main_y, {main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}>
Variables:
main_x, main_y, main_tmp, main_xtmp
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000921s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009555s
[29016 : 29072]
[29016 : 29073]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021073s
Time used: 0.017775

[29016 : 29077]
[29016 : 29081]
Successful child: 29077

Program does NOT terminate