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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l9, true>
<l1, l2, true>
<l2, l3, ((0 + (~(1) * x_5^0)) <= 0) /\ ((0 + x_5^0) <= 0)>
<l2, l3, ((0 + (~(1) * x_5^0)) <= 0) /\ (0 <= (~(1) + x_5^0)) /\ (undef7 = undef7) /\ (undef6 = (1 + undef7)) /\ ((0 + (~(1) * undef6)) <= 0) /\ ((0 + undef6) <= 0), par{x_5^0 -> undef6}>
<l2, l3, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef10 = undef10) /\ (undef9 = (~(1) + undef10)) /\ ((0 + (~(1) * undef9)) <= 0) /\ ((0 + undef9) <= 0), par{x_5^0 -> undef9}>
<l2, l4, ((0 + (~(1) * x_5^0)) <= 0) /\ (0 <= (~(1) + x_5^0)) /\ (undef13 = undef13) /\ (undef14 = (1 + undef13)) /\ ((0 + (~(1) * undef14)) <= 0) /\ (0 <= (~(1) + undef14)) /\ (undef15 = undef15), par{x_5^0 -> (1 + undef15)}>
<l4, l2, true>
<l2, l5, ((0 + (~(1) * x_5^0)) <= 0) /\ (0 <= (~(1) + x_5^0)) /\ (undef20 = undef20) /\ (undef21 = (1 + undef20)) /\ (0 <= (~(1) + (~(1) * undef21))) /\ (undef22 = undef22), par{x_5^0 -> (~(1) + undef22)}>
<l5, l2, true>
<l2, l6, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef27 = undef27) /\ (undef28 = (~(1) + undef27)) /\ ((0 + (~(1) * undef28)) <= 0) /\ (0 <= (~(1) + undef28)) /\ (undef29 = undef29), par{x_5^0 -> (1 + undef29)}>
<l6, l2, true>
<l2, l7, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef34 = undef34) /\ (undef35 = (~(1) + undef34)) /\ (0 <= (~(1) + (~(1) * undef35))) /\ (undef36 = undef36), par{x_5^0 -> (~(1) + undef36)}>
<l7, l2, true>
<l3, l8, (undef39 = undef39), par{Result_4^0 -> undef39}>
<l9, l1, true>

Fresh variables:
undef6, undef7, undef9, undef10, undef13, undef14, undef15, undef20, undef21, undef22, undef27, undef28, undef29, undef34, undef35, undef36, undef39, 

Undef variables:
undef6, undef7, undef9, undef10, undef13, undef14, undef15, undef20, undef21, undef22, undef27, undef28, undef29, undef34, undef35, undef36, undef39, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l8, ((0 + (~(1) * x_5^0)) <= 0) /\ ((0 + x_5^0) <= 0) /\ (undef39 = undef39)>
<l2, l8, ((0 + (~(1) * x_5^0)) <= 0) /\ (0 <= (~(1) + x_5^0)) /\ (undef7 = undef7) /\ (undef6 = (1 + undef7)) /\ ((0 + (~(1) * undef6)) <= 0) /\ ((0 + undef6) <= 0) /\ (undef39 = undef39), par{x_5^0 -> undef6}>
<l2, l8, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef10 = undef10) /\ (undef9 = (~(1) + undef10)) /\ ((0 + (~(1) * undef9)) <= 0) /\ ((0 + undef9) <= 0) /\ (undef39 = undef39), par{x_5^0 -> undef9}>
<l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (0 <= (~(1) + x_5^0)) /\ (undef13 = undef13) /\ (undef14 = (1 + undef13)) /\ ((0 + (~(1) * undef14)) <= 0) /\ (0 <= (~(1) + undef14)) /\ (undef15 = undef15), par{x_5^0 -> (1 + undef15)}>
<l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (0 <= (~(1) + x_5^0)) /\ (undef20 = undef20) /\ (undef21 = (1 + undef20)) /\ (0 <= (~(1) + (~(1) * undef21))) /\ (undef22 = undef22), par{x_5^0 -> (~(1) + undef22)}>
<l2, l2, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef27 = undef27) /\ (undef28 = (~(1) + undef27)) /\ ((0 + (~(1) * undef28)) <= 0) /\ (0 <= (~(1) + undef28)) /\ (undef29 = undef29), par{x_5^0 -> (1 + undef29)}>
<l2, l2, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef34 = undef34) /\ (undef35 = (~(1) + undef34)) /\ (0 <= (~(1) + (~(1) * undef35))) /\ (undef36 = undef36), par{x_5^0 -> (~(1) + undef36)}>

Fresh variables:
undef6, undef7, undef9, undef10, undef13, undef14, undef15, undef20, undef21, undef22, undef27, undef28, undef29, undef34, undef35, undef36, undef39, 

Undef variables:
undef6, undef7, undef9, undef10, undef13, undef14, undef15, undef20, undef21, undef22, undef27, undef28, undef29, undef34, undef35, undef36, undef39, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= x_5^0 /\ 1 <= undef14 /\ 1 + undef13 = undef14, {x_5^0 -> 1 + undef15, rest remain the same}>
<l2, l2, 1 <= x_5^0 /\ 1 + undef21 <= 0 /\ 1 + undef20 = undef21, {x_5^0 -> -1 + undef22, rest remain the same}>
<l2, l2, 1 + x_5^0 <= 0 /\ 1 <= undef28 /\ undef27 = 1 + undef28, {x_5^0 -> 1 + undef29, rest remain the same}>
<l2, l2, 1 + x_5^0 <= 0 /\ 1 + undef35 <= 0 /\ undef34 = 1 + undef35, {x_5^0 -> -1 + undef36, rest remain the same}>
Variables:
x_5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l8, x_5^0 = 0, {all remain the same}>
<l2, l8, 1 <= x_5^0 /\ undef6 = 0 /\ undef6 = 1 + undef7, {x_5^0 -> undef6, rest remain the same}>
<l2, l8, 1 + x_5^0 <= 0 /\ undef9 = 0 /\ 1 + undef9 = undef10, {x_5^0 -> undef9, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001845s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010905s
[6679 : 6680]
[6679 : 6681]
Successful child: 6680
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= x_5^0 /\ 1 <= undef14 /\ 1 + undef13 = undef14, {x_5^0 -> 1 + undef15, 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 <= x_5^0 /\ 1 + undef21 <= 0 /\ 1 + undef20 = undef21, {x_5^0 -> -1 + undef22, 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 + x_5^0 <= 0 /\ 1 <= undef28 /\ undef27 = 1 + undef28, {x_5^0 -> 1 + undef29, 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 + x_5^0 <= 0 /\ 1 + undef35 <= 0 /\ undef34 = 1 + undef35, {x_5^0 -> -1 + undef36, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= x_5^0 /\ 1 <= undef14 /\ 1 + undef13 = undef14, {x_5^0 -> 1 + undef15, 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 <= x_5^0 /\ 1 + undef21 <= 0 /\ 1 + undef20 = undef21, {x_5^0 -> -1 + undef22, 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 + x_5^0 <= 0 /\ 1 <= undef28 /\ undef27 = 1 + undef28, {x_5^0 -> 1 + undef29, 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 + x_5^0 <= 0 /\ 1 + undef35 <= 0 /\ undef34 = 1 + undef35, {x_5^0 -> -1 + undef36, rest remain the same}>
New Graphs: 
[6679 : 6685]
[6679 : 6686]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: x_5^0 <= 0 , 0 <= x_5^0 , 
Narrowing transition: 
<l2, l2, 1 <= x_5^0 /\ 1 <= undef14 /\ 1 + undef13 = undef14, {x_5^0 -> 1 + undef15, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= x_5^0 /\ 1 + undef21 <= 0 /\ 1 + undef20 = undef21, {x_5^0 -> -1 + undef22, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 + x_5^0 <= 0 /\ 1 <= undef28 /\ undef27 = 1 + undef28, {x_5^0 -> 1 + undef29, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 + x_5^0 <= 0 /\ 1 + undef35 <= 0 /\ undef34 = 1 + undef35, {x_5^0 -> -1 + undef36, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 <= x_5^0 /\ 1 <= undef14 /\ 1 + undef13 = undef14, {x_5^0 -> 1 + undef15, rest remain the same}>
<l2, l2, 1 <= x_5^0 /\ 1 + undef21 <= 0 /\ 1 + undef20 = undef21, {x_5^0 -> -1 + undef22, rest remain the same}>
<l2, l2, 1 + x_5^0 <= 0 /\ 1 <= undef28 /\ undef27 = 1 + undef28, {x_5^0 -> 1 + undef29, rest remain the same}>
<l2, l2, 1 + x_5^0 <= 0 /\ 1 + undef35 <= 0 /\ undef34 = 1 + undef35, {x_5^0 -> -1 + undef36, rest remain the same}>
Variables:
x_5^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001781s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010505s
[6679 : 6687]
[6679 : 6688]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020694s
Time used: 0.019448

[6679 : 6701]
[6679 : 6704]
Successful child: 6704

Program does NOT terminate