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


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

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

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

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

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

crypto/bn/bn_mul.c:931:17: Call
  929.   # endif
  930.           if (al == 8) {
  931.               if (bn_wexpand(rr, 16) == NULL)
                         ^
  932.                   goto err;
  933.               rr->top = 16;

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_mul` 
        349.               a1 = B[1];
        350.               a2 = B[2];
        351.               a3 = B[3];
                                ^
        352.               A[0] = a0;
        353.               A[1] = a1;
