crypto/bn/bn_mont.c:158: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul`.
Showing all 19 steps of the trace


crypto/bn/bn_mont.c:149:11: Call
147.   
148.       BN_CTX_start(ctx);
149.       tmp = BN_CTX_get(ctx);
                 ^
150.       if (tmp == NULL)
151.           goto err;

crypto/bn/bn_ctx.c:284:5: Call
  282.       }
  283.       /* OK, make sure the returned bignum is "zero" */
  284.       BN_zero(ret);
             ^
  285.       ctx->used++;
  286.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

crypto/bn/bn_mont.c:158:14: Call
156.               goto err;
157.       } else {
158.           if (!BN_mul(tmp, a, b, ctx))
                    ^
159.               goto err;
160.       }

crypto/bn/bn_mul.c:883:1: Parameter `a->top`
  881.   #endif                          /* BN_RECURSION */
  882.   
  883. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  884.   {
  885.       int ret = 0;

crypto/bn/bn_mul.c:900:5: Assignment
  898.       bn_check_top(r);
  899.   
  900.       al = a->top;
             ^
  901.       bl = b->top;
  902.   

crypto/bn/bn_mul.c:964:17: Call
  962.                   if (bn_wexpand(rr, k * 4) == NULL)
  963.                       goto err;
  964.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  965.                                         j, al - j, bl - j, t->d);
  966.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:534:1: Parameter `n`
    532.    */
    533.   /* tnX may not be negative but less than n */
    534. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
    535.                              int tna, int tnb, BN_ULONG *t)
    536.   {

crypto/bn/bn_mul.c:597:9: Call
    595.       } else {
    596.           p = &(t[n2 * 2]);
    597.           bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
                   ^
    598.           bn_mul_recursive(r, a, b, n, 0, 0, p);
    599.           i = n / 2;

crypto/bn/bn_mul.c:387:1: Parameter `*b`
      385.    */
      386.   /* dnX may not be positive, but n2/2+dnX has to be */
      387. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      388.                         int dna, int dnb, BN_ULONG *t)
      389.   {

crypto/bn/bn_mul.c:421:10: Call
      419.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      420.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
      421.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                      ^
      422.       zero = neg = 0;
      423.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:782:1: Parameter `cl`
        780.    */
        781.   
        782. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        783.   {
        784.       int n, i;

crypto/bn/bn_lib.c:799:12: Call
        797.           }
        798.       }
        799.       return bn_cmp_words(a, b, cl);
                          ^
        800.   }
        801.   

crypto/bn/bn_lib.c:755:1: <Offset trace>
753.   }
754.   
755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
756.   {
757.       int i;

crypto/bn/bn_lib.c:755:1: Parameter `n`
          753.   }
          754.   
          755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          756.   {
          757.       int i;

crypto/bn/bn_lib.c:764:10: Assignment
          762.       if (aa != bb)
          763.           return ((aa > bb) ? 1 : -1);
          764.       for (i = n - 2; i >= 0; i--) {
                          ^
          765.           aa = a[i];
          766.           bb = b[i];

crypto/bn/bn_lib.c:755:1: <Length trace>
753.   }
754.   
755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
756.   {
757.       int i;

crypto/bn/bn_lib.c:755:1: Parameter `*b`
          753.   }
          754.   
          755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          756.   {
          757.       int i;

crypto/bn/bn_lib.c:766:14: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul` 
          764.       for (i = n - 2; i >= 0; i--) {
          765.           aa = a[i];
          766.           bb = b[i];
                              ^
          767.           if (aa != bb)
          768.               return ((aa > bb) ? 1 : -1);
