Shortest Lattice Vector

Let $t_{n}$ be the tribonacci numbers defined as:
$t_{0} = t_{1} = 0$ ;
$t_{2} = 1$ ;
$t_{n} = t_{n - 1} + t_{n - 2} + t_{n - 3}$ for $n \geq 3$
and let $r_{n} = t_{n} mod 10^{7}$ .

For each pair of Vectors $V_{n} = (v_{1}, v_{2}, v_{3})$ and $W_{n} = (w_{1}, w_{2}, w_{3})$ with $v_{1} = r_{12 n - 11} - r_{12 n - 10}, v_{2} = r_{12 n - 9} + r_{12 n - 8}, v_{3} = r_{12 n - 7} \cdot r_{12 n - 6}$ and
$w_{1} = r_{12 n - 5} - r_{12 n - 4}, w_{2} = r_{12 n - 3} + r_{12 n - 2}, w_{3} = r_{12 n - 1} \cdot r_{12 n}$
we define $S (n)$ as the minimal value of the manhattan length of the vector $D = k \cdot V_{n} + l \cdot W_{n}$ measured as $| k \cdot v_{1} + l \cdot w_{1} | + | k \cdot v_{2} + l \cdot w_{2} | + | k \cdot v_{3} + l \cdot w_{3} |$ for any integers $k$ and $l$ with $(k, l) \neq (0, 0)$ .

The first vector pair is $(- 1, 3, 28)$ , $(- 11, 125, 40826)$ .
You are given that $S (1) = 32$ and $\sum_{n = 1}^{10} S (n) = 130762273722$ .

Find $\sum_{n = 1}^{20000000} S (n)$ .

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.