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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, ((0 + x_5^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
<l1, l2, (0 <= (~(1) + x_5^0)) /\ ((0 + y_6^0) <= 0) /\ (undef6 = undef6), par{Result_4^0 -> undef6}>
<l1, l2, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (((0 + x_5^0) + y_6^0) <= 0) /\ (undef11 = undef11), par{Result_4^0 -> undef11}>
<l1, l3, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (0 <= ((~(1) + x_5^0) + y_6^0)) /\ (undef18 = undef18) /\ ((0 + undef18) <= 0) /\ (0 <= (0 + undef18)) /\ (undef19 = (~(2) + y_6^0)), par{tmp_7^0 -> undef18, x_5^0 -> undef19, y_6^0 -> (1 + undef19)}>
<l3, l1, true>
<l1, l4, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (0 <= ((~(1) + x_5^0) + y_6^0)) /\ (undef28 = undef28), par{tmp_7^0 -> undef28}>
<l4, l5, (undef32 = __disjvr_0^0) /\ (__disjvr_0^0 = undef32), par{__disjvr_0^0 -> undef32}>
<l5, l6, (undef39 = (~(1) + x_5^0)), par{x_5^0 -> undef39, y_6^0 -> (0 + undef39)}>
<l6, l1, true>
<l7, l1, true>
<l8, l7, true>

Fresh variables:
undef1, undef6, undef11, undef18, undef19, undef28, undef32, undef39, 

Undef variables:
undef1, undef6, undef11, undef18, undef19, undef28, undef32, undef39, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l2, ((0 + x_5^0) <= 0) /\ (undef1 = undef1)>
<l1, l2, (0 <= (~(1) + x_5^0)) /\ ((0 + y_6^0) <= 0) /\ (undef6 = undef6)>
<l1, l1, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (0 <= ((~(1) + x_5^0) + y_6^0)) /\ (undef18 = undef18) /\ ((0 + undef18) <= 0) /\ (0 <= (0 + undef18)) /\ (undef19 = (~(2) + y_6^0)), par{x_5^0 -> undef19, y_6^0 -> (1 + undef19)}>
<l1, l1, (0 <= (~(1) + x_5^0)) /\ (0 <= (~(1) + y_6^0)) /\ (0 <= ((~(1) + x_5^0) + y_6^0)) /\ (undef28 = undef28) /\ (undef32 = __disjvr_0^0) /\ (__disjvr_0^0 = undef32) /\ (undef39 = (~(1) + x_5^0)), par{__disjvr_0^0 -> undef32, x_5^0 -> undef39, y_6^0 -> (0 + undef39)}>

Fresh variables:
undef1, undef6, undef11, undef18, undef19, undef28, undef32, undef39, 

Undef variables:
undef1, undef6, undef11, undef18, undef19, undef28, undef32, undef39, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ undef18 = 0 /\ y_6^0 = 2 + undef19, {x_5^0 -> undef19, y_6^0 -> 1 + undef19, rest remain the same}>
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ __disjvr_0^0 = undef32 /\ x_5^0 = 1 + undef39, {__disjvr_0^0 -> undef32, x_5^0 -> undef39, y_6^0 -> undef39, rest remain the same}>
Variables:
x_5^0, y_6^0, __disjvr_0^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l1, l2, x_5^0 <= 0, {all remain the same}>
<l1, l2, y_6^0 <= 0 /\ 1 <= x_5^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001598s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.022672s
[25131 : 25132]
[25131 : 25133]
Successful child: 25132
[ 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: 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ undef18 = 0 /\ y_6^0 = 2 + undef19, {x_5^0 -> undef19, y_6^0 -> 1 + undef19, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ __disjvr_0^0 = undef32 /\ x_5^0 = 1 + undef39, {__disjvr_0^0 -> undef32, x_5^0 -> undef39, y_6^0 -> undef39, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ __disjvr_0^0 = undef32 /\ x_5^0 = 1 + undef39, {__disjvr_0^0 -> undef32, x_5^0 -> undef39, y_6^0 -> undef39, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ undef18 = 0 /\ y_6^0 = 2 + undef19, {x_5^0 -> undef19, y_6^0 -> 1 + undef19, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000474s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: x_5^0 <= 0 , 
Narrowing transition: 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ undef18 = 0 /\ y_6^0 = 2 + undef19, {x_5^0 -> undef19, y_6^0 -> 1 + undef19, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ __disjvr_0^0 = undef32 /\ x_5^0 = 1 + undef39, {__disjvr_0^0 -> undef32, x_5^0 -> undef39, y_6^0 -> undef39, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ undef18 = 0 /\ y_6^0 = 2 + undef19, {x_5^0 -> undef19, y_6^0 -> 1 + undef19, rest remain the same}>
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ __disjvr_0^0 = undef32 /\ x_5^0 = 1 + undef39, {__disjvr_0^0 -> undef32, x_5^0 -> undef39, y_6^0 -> undef39, rest remain the same}>
Variables:
x_5^0, y_6^0, __disjvr_0^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001577s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.022500s
[25131 : 25137]
[25131 : 25138]
Successful child: 25137
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ y_6^0 <= 1 + x_5^0 /\ undef18 = 0 /\ y_6^0 = 2 + undef19, {x_5^0 -> undef19, y_6^0 -> 1 + undef19, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ y_6^0 <= 1 + x_5^0 /\ __disjvr_0^0 = undef32 /\ x_5^0 = 1 + undef39, {__disjvr_0^0 -> undef32, x_5^0 -> undef39, y_6^0 -> undef39, 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): 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ y_6^0 <= 1 + x_5^0 /\ undef18 = 0 /\ y_6^0 = 2 + undef19, {x_5^0 -> undef19, y_6^0 -> 1 + undef19, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ y_6^0 <= 1 + x_5^0 /\ __disjvr_0^0 = undef32 /\ x_5^0 = 1 + undef39, {__disjvr_0^0 -> undef32, x_5^0 -> undef39, y_6^0 -> undef39, rest remain the same}>
Ranking function: x_5^0
New Graphs: 

LOG: CALL check - Post:y_6^0 <= 1 + x_5^0 - Process 2
* Exit transition: <l0, l1, 1 <= x_5^0, {all remain the same}>
* Postcondition  : y_6^0 <= 1 + x_5^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000511s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: y_6^0 <= 1 + x_5^0 , 
It's unfeasible. Removing transition: 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ undef18 = 0 /\ y_6^0 = 2 + undef19, {x_5^0 -> undef19, y_6^0 -> 1 + undef19, rest remain the same}>
It's unfeasible. Removing transition: 
<l1, l1, 1 <= x_5^0 /\ 1 <= x_5^0 + y_6^0 /\ 1 <= y_6^0 /\ __disjvr_0^0 = undef32 /\ x_5^0 = 1 + undef39, {__disjvr_0^0 -> undef32, x_5^0 -> undef39, y_6^0 -> undef39, rest remain the same}>
invGraph after Narrowing: 
Transitions:
Variables:
x_5^0, y_6^0, __disjvr_0^0
Analyzing SCC {l1}...
No cycles found.

Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates