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


crypto/bn/bn_exp.c:208:13: Call
206.               goto err;
207.           aa->neg = 0;
208.           if (BN_RECP_CTX_set(&recp, aa, ctx) <= 0)
                   ^
209.               goto err;
210.       } else {

crypto/bn/bn_recp.c:44:1: Parameter `*recp->Nr.d`
  42.   }
  43.   
  44. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  45.   {
  46.       if (!BN_copy(&(recp->N), d))

crypto/bn/bn_exp.c:248:22: Call
246.           if (BN_is_bit_set(p, wstart) == 0) {
247.               if (!start)
248.                   if (!BN_mod_mul_reciprocal(r, r, r, &recp, ctx))
                            ^
249.                       goto err;
250.               if (wstart == 0)

crypto/bn/bn_recp.c:54:1: Parameter `*recp->Nr.d`
  52.   }
  53.   
  54. > int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
  55.                             BN_RECP_CTX *recp, BN_CTX *ctx)
  56.   {

crypto/bn/bn_recp.c:76:11: Call
  74.           ca = x;                 /* Just do the mod */
  75.   
  76.       ret = BN_div_recp(NULL, r, ca, recp, ctx);
                  ^
  77.    err:
  78.       BN_CTX_end(ctx);

crypto/bn/bn_recp.c:90:9: Call
    88.   
    89.       BN_CTX_start(ctx);
    90.       a = BN_CTX_get(ctx);
                  ^
    91.       b = BN_CTX_get(ctx);
    92.       if (dv != NULL)

crypto/bn/bn_ctx.c:229:5: Call
      227.       }
      228.       /* OK, make sure the returned bignum is "zero" */
      229.       BN_zero(ret);
                 ^
      230.       ctx->used++;
      231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:463:1: Parameter `*a->d`
        461.   }
        462.   
        463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
        464.   {
        465.       bn_check_top(a);

crypto/bn/bn_lib.c:466:9: Call
        464.   {
        465.       bn_check_top(a);
        466.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                       ^
        467.           return (0);
        468.       a->neg = 0;

crypto/bn/bn_lcl.h:674:1: Parameter `*a->d`
          672.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
          673.   
          674. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
          675.   {
          676.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_recp.c:137:10: Call
    135.        *    = |m/N|
    136.        */
    137.       if (!BN_rshift(a, m, recp->num_bits))
                    ^
    138.           goto err;
    139.       if (!BN_mul(b, a, &(recp->Nr), ctx))

crypto/bn/bn_shift.c:120:1: Parameter `*r->d`
      118.   }
      119.   
      120. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
      121.   {
      122.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:143:13: Call
      141.       i = (BN_num_bits(a) - n + (BN_BITS2 - 1)) / BN_BITS2;
      142.       if (r != a) {
      143.           if (bn_wexpand(r, i) == NULL)
                         ^
      144.               return (0);
      145.           r->neg = a->neg;

crypto/bn/bn_lib.c:1016:1: Parameter `*a->d`
        1014.   }
        1015.   
        1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        1017.   {
        1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:1018:37: Call
        1016.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
        1017.   {
        1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                    ^
        1019.   }
        1020.   

crypto/bn/bn_lib.c:323:1: Parameter `*b->d`
          321.    */
          322.   
          323. > BIGNUM *bn_expand2(BIGNUM *b, int words)
          324.   {
          325.       bn_check_top(b);

crypto/bn/bn_lib.c:328:23: Call
          326.   
          327.       if (words > b->dmax) {
          328.           BN_ULONG *a = bn_expand_internal(b, words);
                                       ^
          329.           if (!a)
          330.               return NULL;

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

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

crypto/bn/bn_lib.c:272:5: Assignment
            270.   
            271.   #if 1
            272.       B = b->d;
                       ^
            273.       /* Check if the previous number needs to be copied */
            274.       if (B != NULL) {

crypto/bn/bn_lib.c:289:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_mod_mul_reciprocal` 
            287.               a1 = B[1];
            288.               a2 = B[2];
            289.               a3 = B[3];
                                    ^
            290.               A[0] = a0;
            291.               A[1] = a1;
