Numerical Terao's conjecture for line arrangements

Let $\mathbb{F}$ be a fixed field and let $\mathcal{L} \subset \mathbb{P}^{2}_{\mathbb{F}}$ be an arrangement of $d$ lines. Its weak-combinatorics is the vector

$$W(\mathcal{L})=(d;t_{2},\ldots,t_{d}),$$

where $t_i$ denotes the number of $i$-fold intersection points, with zero entries for $i>m(\mathcal{L})$ omitted, where $m(\mathcal{L})$ is the maximal intersection multiplicity. A line arrangement is free when its associated derivation module is free.

Numerical Terao's conjecture. If $\mathcal{L}_{1},\mathcal{L}_{2}\subset\mathbb{P}^{2}_{\mathbb{F}}$ are line arrangements satisfying

$$W(\mathcal{L}_{1})=W(\mathcal{L}_{2}),$$

then $\mathcal{L}_{1}$ is free if and only if $\mathcal{L}_{2}$ is free.

This asks whether freeness can be determined by the numerical data of intersection points, which is weaker than the full intersection lattice. The source presents it as a weaker version of Terao's conjecture; no resolution is given.