crypto/bn/bn_print.c:142: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_div_word`.
Showing all 16 steps of the trace


crypto/bn/bn_print.c:127:14: Call
125.           goto err;
126.       }
127.       if ((t = BN_dup(a)) == NULL)
                    ^
128.           goto err;
129.   

crypto/bn/bn_lib.c:420:10: Call
  418.       if (t == NULL)
  419.           return NULL;
  420.       if (!BN_copy(t, a)) {
                  ^
  421.           BN_free(t);
  422.           return NULL;

crypto/bn/bn_lib.c:428:1: Parameter `*a->d`
    426.   }
    427.   
    428. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    429.   {
    430.       int i;

crypto/bn/bn_print.c:142:19: Call
140.           i = 0;
141.           while (!BN_is_zero(t)) {
142.               *lp = BN_div_word(t, BN_DEC_CONV);
                         ^
143.               lp++;
144.           }

crypto/bn/bn_word.c:87:1: Parameter `*a->d`
  85.   }
  86.   
  87. > BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)
  88.   {
  89.       BN_ULONG ret = 0;

crypto/bn/bn_word.c:104:10: Call
  102.       j = BN_BITS2 - BN_num_bits_word(w);
  103.       w <<= j;
  104.       if (!BN_lshift(a, a, j))
                  ^
  105.           return (BN_ULONG)-1;
  106.   

crypto/bn/bn_shift.c:129:1: Parameter `*r->d`
    127.   }
    128.   
    129. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
    130.   {
    131.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:9: Call
    143.       r->neg = a->neg;
    144.       nw = n / BN_BITS2;
    145.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                   ^
    146.           return (0);
    147.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:994:1: Parameter `*a->d`
      992.   }
      993.   
      994. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      995.   {
      996.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:996:37: Call
      994.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      995.   {
      996.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                 ^
      997.   }
      998.   

crypto/bn/bn_lib.c:389:1: Parameter `*b->d`
        387.    */
        388.   
        389. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        390.   {
        391.       bn_check_top(b);

crypto/bn/bn_lib.c:394:23: Call
        392.   
        393.       if (words > b->dmax) {
        394.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        395.           if (!a)
        396.               return NULL;

crypto/bn/bn_lib.c:299:1: <Length trace>
297.   /* This is used by bn_expand2() */
298.   /* The caller MUST check that words > b->dmax before calling this */
299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
300.   {
301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:299:1: Parameter `*b->d`
          297.   /* This is used by bn_expand2() */
          298.   /* The caller MUST check that words > b->dmax before calling this */
          299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          300.   {
          301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:334:5: Assignment
          332.   
          333.   #if 1
          334.       B = b->d;
                     ^
          335.       /* Check if the previous number needs to be copied */
          336.       if (B != NULL) {

crypto/bn/bn_lib.c:351:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_div_word` 
          349.               a1 = B[1];
          350.               a2 = B[2];
          351.               a3 = B[3];
                                  ^
          352.               A[0] = a0;
          353.               A[1] = a1;
