Palindromic length of infinite aperiodic words

The palindromic length of the finite word $v$ is equal to the minimal number of palindromes whose concatenation is equal to $v$. It was conjectured in 2013 that for every aperiodic infinite word $x$, the palindromic length of its factors is not bounded. We prove this conjecture to be true.