Research Collatz odd sequence, change (×3 + 1) ÷ 2^k operation in Collatz Conjecture to (×3 + 2^m − 1) ÷ 2^k operation. Expand loop Collatz odd sequence (if exists) in (×3 + 2^m − 1) ÷ 2^k odd sequence to become ∞-steps non-loop sequence. Build a (×3 + 2^m − 1) ÷ 2k odd tree model and transform position model for odds in tree. Via comparing actual and virtual positions, prove if a (×3 + 2^m − 1) ÷ 2^k odd sequence can not converge after ∞ steps of (×3 + 2^m − 1) ÷ 2^k operation, the sequence must walk out of the boundary of the tree.