crypto/bn/bn_exp.c:348: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_mod_mul_reciprocal`.
Showing all 19 steps of the trace


crypto/bn/bn_exp.c:308:13: Call
306.               goto err;
307.           aa->neg = 0;
308.           if (BN_RECP_CTX_set(&recp, aa, ctx) <= 0)
                   ^
309.               goto err;
310.       } else {

crypto/bn/bn_recp.c:93:1: Parameter `*recp->Nr.d`
  91.   }
  92.   
  93. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  94.   {
  95.       if (!BN_copy(&(recp->N), d))

crypto/bn/bn_exp.c:348:22: Call
346.           if (BN_is_bit_set(p, wstart) == 0) {
347.               if (!start)
348.                   if (!BN_mod_mul_reciprocal(r, r, r, &recp, ctx))
                            ^
349.                       goto err;
350.               if (wstart == 0)

crypto/bn/bn_recp.c:103:1: Parameter `*recp->Nr.d`
  101.   }
  102.   
  103. > int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
  104.                             BN_RECP_CTX *recp, BN_CTX *ctx)
  105.   {

crypto/bn/bn_recp.c:125:11: Call
  123.           ca = x;                 /* Just do the mod */
  124.   
  125.       ret = BN_div_recp(NULL, r, ca, recp, ctx);
                   ^
  126.    err:
  127.       BN_CTX_end(ctx);

crypto/bn/bn_recp.c:139:9: Call
    137.   
    138.       BN_CTX_start(ctx);
    139.       a = BN_CTX_get(ctx);
                   ^
    140.       b = BN_CTX_get(ctx);
    141.       if (dv != NULL)

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_recp.c:186:10: Call
    184.        *    = |m/N|
    185.        */
    186.       if (!BN_rshift(a, m, recp->num_bits))
                    ^
    187.           goto err;
    188.       if (!BN_mul(b, a, &(recp->Nr), ctx))

crypto/bn/bn_shift.c:169:1: Parameter `*r->d`
      167.   }
      168.   
      169. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
      170.   {
      171.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:193:13: Call
      191.       if (r != a) {
      192.           r->neg = a->neg;
      193.           if (bn_wexpand(r, i) == NULL)
                         ^
      194.               return (0);
      195.       } else {

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

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

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

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

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

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

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

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