crypto/ec/ecp_smpl.c:1307: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_mod_inverse`.
Showing all 20 steps of the trace


crypto/ec/ecp_smpl.c:1258:11: Call
1256.   
1257.       BN_CTX_start(ctx);
1258.       tmp = BN_CTX_get(ctx);
                  ^
1259.       tmp_Z = BN_CTX_get(ctx);
1260.       if (tmp == NULL || tmp_Z == NULL)

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/ec/ecp_smpl.c:1307:10: Call
1305.        */
1306.   
1307.       if (!BN_mod_inverse(tmp, prod_Z[num - 1], group->field, ctx)) {
                 ^
1308.           ECerr(EC_F_EC_GFP_SIMPLE_POINTS_MAKE_AFFINE, ERR_R_BN_LIB);
1309.           goto err;

crypto/bn/bn_gcd.c:225:1: Parameter `*in->d`
  223.                                           BN_CTX *ctx);
  224.   
  225. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  226.                          const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  227.   {

crypto/bn/bn_gcd.c:230:10: Call
  228.       BIGNUM *rv;
  229.       int noinv;
  230.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                  ^
  231.       if (noinv)
  232.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:236:1: Parameter `*in->d`
    234.   }
    235.   
    236. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
    237.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
    238.                              int *pnoinv)

crypto/bn/bn_gcd.c:249:16: Call
    247.       if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0)
    248.           || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0)) {
    249.           return BN_mod_inverse_no_branch(in, a, n, ctx);
                          ^
    250.       }
    251.   

crypto/bn/bn_gcd.c:556:1: Parameter `*in->d`
      554.    * not contain branches that may leak sensitive information.
      555.    */
      556. > static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
      557.                                           const BIGNUM *a, const BIGNUM *n,
      558.                                           BN_CTX *ctx)

crypto/bn/bn_gcd.c:704:18: Call
      702.           /* Y*a == 1  (mod |n|) */
      703.           if (!Y->neg && BN_ucmp(Y, n) < 0) {
      704.               if (!BN_copy(R, Y))
                              ^
      705.                   goto err;
      706.           } else {

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_lib.c:438:9: Call
        436.       if (a == b)
        437.           return (a);
        438.       if (bn_wexpand(a, b->top) == NULL)
                       ^
        439.           return (NULL);
        440.   

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