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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, (undef2 = (~(1) + y^0)), par{y^0 -> undef2, z^0 -> ((0 + undef2) + z^0)}>
<l1, l2, true, par{x^0 -> (~(1) + x^0), y^0 -> (~(1) + y^0)}>
<l2, l1, (0 <= (0 + x^0)) /\ ((0 + y^0) <= (0 + z^0))>
<l3, l2, true>
<l4, l3, true>

Fresh variables:
undef2, 

Undef variables:
undef2, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l2, (0 <= (0 + x^0)) /\ ((0 + y^0) <= (0 + z^0)) /\ (undef2 = (~(1) + y^0)), par{y^0 -> undef2, z^0 -> ((0 + undef2) + z^0)}>
<l2, l2, (0 <= (0 + x^0)) /\ ((0 + y^0) <= (0 + z^0)), par{x^0 -> (~(1) + x^0), y^0 -> (~(1) + y^0)}>

Fresh variables:
undef2, 

Undef variables:
undef2, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 0 <= x^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
<l2, l2, 0 <= x^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>
Variables:
x^0, y^0, z^0

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001462s
Ranking function: x^0
New Graphs: 
Transitions:
<l2, l2, 0 <= x^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000729s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002540s
[38074 : 38075]
[38074 : 38076]
Successful child: 38075
[ 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, 1 + x^0 + z^0 <= 0 /\ 0 <= x^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + x^0 + z^0 <= 0 /\ 0 <= x^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + x^0 + z^0 <= 0 /\ 0 <= x^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
Ranking function: -3*y^0 + 2*z^0
New Graphs: 

LOG: CALL check - Post:1 + x^0 + z^0 <= 0 - Process 1
* Exit transition: <l0, l2, true, {all remain the same}>
* Postcondition  : 1 + x^0 + z^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000375s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + x^0 + z^0 <= 0 , 
Narrowing transition: 
<l2, l2, 0 <= x^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 0 <= x^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= x^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
<l2, l2, 0 <= x^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001653s
Ranking function: x^0
New Graphs: 
Transitions:
<l2, l2, 0 <= x^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000773s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003031s
[38074 : 38080]
[38074 : 38081]
Successful child: 38080
[ 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 <= x^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, 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 <= x^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 0 <= x^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + x^0 + z^0 <= y^0 - Process 2
* Exit transition: <l0, l2, 0 <= x^0 + z^0, {all remain the same}>
* Postcondition  : 1 + x^0 + z^0 <= y^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000486s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + x^0 + z^0 <= y^0 , 
Narrowing transition: 
<l2, l2, 0 <= x^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 0 <= x^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001921s
Ranking function: x^0
New Graphs: 
Transitions:
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000848s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003422s
[38074 : 38085]
[38074 : 38086]
Successful child: 38085
[ 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 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, 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 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, 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 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + x^0 <= 0 - Process 3
* Exit transition: <l0, l2, y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0, {all remain the same}>
* Postcondition  : 1 + x^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000525s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + x^0 <= 0 , 
Narrowing transition: 
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001970s
Ranking function: x^0
New Graphs: 
Transitions:
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000867s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003422s
[38074 : 38090]
[38074 : 38091]
Successful child: 38090
[ 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, x^0 + y^0 <= 0 /\ 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, x^0 + y^0 <= 0 /\ 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, 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, x^0 + y^0 <= 0 /\ 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
Ranking function: x^0 + z^0
New Graphs: 

LOG: CALL check - Post:x^0 + y^0 <= 0 - Process 4
* Exit transition: <l0, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0, {all remain the same}>
* Postcondition  : x^0 + y^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000541s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: x^0 + y^0 <= 0 , 
Narrowing transition: 
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 <= x^0 + y^0 /\ 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0 /\ y^0 = 1 + undef2, {y^0 -> undef2, z^0 -> z^0 + undef2, rest remain the same}>
<l2, l2, 1 <= x^0 + y^0 /\ 0 <= x^0 /\ y^0 <= x^0 + z^0 /\ 0 <= x^0 + z^0 /\ y^0 <= z^0, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002155s
Ranking function: x^0 + y^0
New Graphs: 
Program Terminates