crypto/bn/bn_prime.c:272: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 67108856] by call to `BN_mod_mul`.
Showing all 33 steps of the trace


crypto/bn/bn_prime.c:265:10: Call
263.                      BN_MONT_CTX *mont)
264.   {
265.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                ^
266.           return -1;
267.       if (BN_is_one(w))

crypto/bn/bn_exp.c:294:1: Parameter `a->top`
  292.   }
  293.   
  294. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
  295.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
  296.   {

crypto/bn/bn_prime.c:267:9: Call
265.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
266.           return -1;
267.       if (BN_is_one(w))
               ^
268.           return 0;               /* probably prime */
269.       if (BN_cmp(w, a1) == 0)

crypto/bn/bn_lib.c:857:1: Parameter `a->top`
  855.   }
  856.   
  857. > int BN_is_one(const BIGNUM *a)
  858.   {
  859.       return BN_abs_is_word(a, 1) && !a->neg;

crypto/bn/bn_lib.c:859:12: Call
  857.   int BN_is_one(const BIGNUM *a)
  858.   {
  859.       return BN_abs_is_word(a, 1) && !a->neg;
                    ^
  860.   }
  861.   

crypto/bn/bn_lib.c:847:1: Parameter `a->top`
    845.   }
    846.   
    847. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
    848.   {
    849.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

crypto/bn/bn_prime.c:269:9: Call
267.       if (BN_is_one(w))
268.           return 0;               /* probably prime */
269.       if (BN_cmp(w, a1) == 0)
               ^
270.           return 0;               /* w == -1 (mod a), 'a' is probably prime */
271.       while (--k) {

crypto/bn/bn_lib.c:577:1: Parameter `a->top`
  575.   }
  576.   
  577. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  578.   {
  579.       int i;

crypto/bn/bn_prime.c:272:14: Call
270.           return 0;               /* w == -1 (mod a), 'a' is probably prime */
271.       while (--k) {
272.           if (!BN_mod_mul(w, w, w, a, ctx)) /* w := w^2 mod a */
                    ^
273.               return -1;
274.           if (BN_is_one(w))

crypto/bn/bn_mod.c:73:1: Parameter `r->top`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/bn/bn_mod.c:93:10: Call
  91.               goto err;
  92.       }
  93.       if (!BN_nnmod(r, t, m, ctx))
                 ^
  94.           goto err;
  95.       bn_check_top(r);

crypto/bn/bn_mod.c:13:1: Parameter `r->top`
    11.   #include "bn_lcl.h"
    12.   
    13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
    14.   {
    15.       /*

crypto/bn/bn_mod.c:20:11: Call
    18.        */
    19.   
    20.       if (!(BN_mod(r, m, d, ctx)))
                    ^
    21.           return 0;
    22.       if (!r->neg)

crypto/bn/bn_div.c:140:1: Parameter `rm->top`
      138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
      139.    */
      140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
      141.              BN_CTX *ctx)
      142.   {

crypto/bn/bn_div.c:185:17: Call
      183.       if (!no_branch && BN_ucmp(num, divisor) < 0) {
      184.           if (rm != NULL) {
      185.               if (BN_copy(rm, num) == NULL)
                             ^
      186.                   return (0);
      187.           }

crypto/bn/bn_lib.c:323:1: Parameter `a->top`
        321.   }
        322.   
        323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
        324.   {
        325.       bn_check_top(b);

crypto/bn/bn_lib.c:329:9: Call
        327.       if (a == b)
        328.           return a;
        329.       if (bn_wexpand(a, b->top) == NULL)
                       ^
        330.           return NULL;
        331.   

crypto/bn/bn_lib.c:948:1: Parameter `a->top`
          946.   }
          947.   
          948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          949.   {
          950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:950:37: Call
          948.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
          949.   {
          950.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                     ^
          951.   }
          952.   

crypto/bn/bn_lib.c:284:1: Parameter `b->top`
            282.    */
            283.   
            284. > BIGNUM *bn_expand2(BIGNUM *b, int words)
            285.   {
            286.       bn_check_top(b);

crypto/bn/bn_lib.c:289:23: Call
            287.   
            288.       if (words > b->dmax) {
            289.           BN_ULONG *a = bn_expand_internal(b, words);
                                         ^
            290.           if (!a)
            291.               return NULL;

crypto/bn/bn_lib.c:246:1: <Offset 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 = NULL;

crypto/bn/bn_lib.c:246:1: Parameter `b->top`
              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 = 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 = NULL;

crypto/bn/bn_lib.c:246:1: Parameter `words`
              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 = NULL;

crypto/bn/bn_lib.c:263:13: Call
              261.           a = OPENSSL_secure_zalloc(words * sizeof(*a));
              262.       else
              263.           a = OPENSSL_zalloc(words * sizeof(*a));
                                 ^
              264.       if (a == NULL) {
              265.           BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);

crypto/mem.c:186:1: Parameter `num`
                184.   }
                185.   
                186. > void *CRYPTO_zalloc(size_t num, const char *file, int line)
                187.   {
                188.       void *ret = CRYPTO_malloc(num, file, line);

crypto/mem.c:188:17: Call
                186.   void *CRYPTO_zalloc(size_t num, const char *file, int line)
                187.   {
                188.       void *ret = CRYPTO_malloc(num, file, line);
                                       ^
                189.   
                190.       FAILTEST();

crypto/mem.c:166:9: Assignment
                  164.   
                  165.       if (num == 0)
                  166.           return NULL;
                                 ^
                  167.   
                  168.       FAILTEST();

crypto/mem.c:188:5: Assignment
                186.   void *CRYPTO_zalloc(size_t num, const char *file, int line)
                187.   {
                188.       void *ret = CRYPTO_malloc(num, file, line);
                           ^
                189.   
                190.       FAILTEST();

crypto/mem.c:193:5: Assignment
                191.       if (ret != NULL)
                192.           memset(ret, 0, num);
                193.       return ret;
                           ^
                194.   }
                195.   

crypto/bn/bn_lib.c:263:9: Assignment
              261.           a = OPENSSL_secure_zalloc(words * sizeof(*a));
              262.       else
              263.           a = OPENSSL_zalloc(words * sizeof(*a));
                             ^
              264.       if (a == NULL) {
              265.           BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);

crypto/bn/bn_lib.c:271:9: Array access: Offset added: [8, +oo] Size: [0, 67108856] by call to `BN_mod_mul` 
              269.       assert(b->top <= words);
              270.       if (b->top > 0)
              271.           memcpy(a, b->d, sizeof(*a) * b->top);
                             ^
              272.   
              273.       return a;
