crypto/rsa/rsa_chk.c:144: error: BUFFER_OVERRUN_L3
  Offset: [-1, +oo] Size: [1, +oo] by call to `BN_mod_mul`.
Showing all 25 steps of the trace


crypto/rsa/rsa_chk.c:85:9: Call
83.   
84.       /* p prime? */
85.       r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, cb);
              ^
86.       if (r != 1) {
87.           ret = r;

crypto/bn/bn_prime.c:293:1: Parameter `ctx_passed->stack.depth`
  291.   }
  292.   
  293. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  294.                      BN_GENCB *cb)
  295.   {

crypto/bn/bn_prime.c:296:12: Call
  294.                      BN_GENCB *cb)
  295.   {
  296.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  297.   }
  298.   

crypto/bn/bn_prime.c:299:1: Parameter `ctx_passed->stack.depth`
    297.   }
    298.   
    299. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    300.                               int do_trial_division, BN_GENCB *cb)
    301.   {

crypto/rsa/rsa_chk.c:94:9: Call
92.   
93.       /* q prime? */
94.       r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb);
              ^
95.       if (r != 1) {
96.           ret = r;

crypto/bn/bn_prime.c:293:1: Parameter `ctx_passed->stack.depth`
  291.   }
  292.   
  293. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  294.                      BN_GENCB *cb)
  295.   {

crypto/bn/bn_prime.c:296:12: Call
  294.                      BN_GENCB *cb)
  295.   {
  296.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  297.   }
  298.   

crypto/bn/bn_prime.c:299:1: Parameter `ctx_passed->stack.depth`
    297.   }
    298.   
    299. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    300.                               int do_trial_division, BN_GENCB *cb)
    301.   {

crypto/rsa/rsa_chk.c:103:9: Call
101.   
102.       /* n = p*q? */
103.       r = BN_mul(i, key->p, key->q, ctx);
               ^
104.       if (!r) {
105.           ret = -1;

crypto/bn/bn_mul.c:882:1: Parameter `ctx->stack.depth`
  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/rsa/rsa_chk.c:144:9: Call
142.       }
143.   
144.       r = BN_mod_mul(i, key->d, key->e, k, ctx);
               ^
145.       if (!r) {
146.           ret = -1;

crypto/bn/bn_mod.c:178:1: Parameter `ctx->stack.depth`
  176.   
  177.   /* slow but works */
  178. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  179.                  BN_CTX *ctx)
  180.   {

crypto/bn/bn_mod.c:188:5: Call
  186.       bn_check_top(m);
  187.   
  188.       BN_CTX_start(ctx);
             ^
  189.       if ((t = BN_CTX_get(ctx)) == NULL)
  190.           goto err;

crypto/bn/bn_ctx.c:227:1: Parameter `ctx->stack.depth`
    225.   }
    226.   
    227. > void BN_CTX_start(BN_CTX *ctx)
    228.   {
    229.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mod.c:192:14: Call
  190.           goto err;
  191.       if (a == b) {
  192.           if (!BN_sqr(t, a, ctx))
                      ^
  193.               goto err;
  194.       } else {

crypto/bn/bn_sqr.c:80:5: Call
    78.       }
    79.   
    80.       BN_CTX_start(ctx);
              ^
    81.       rr = (a != r) ? r : BN_CTX_get(ctx);
    82.       tmp = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:227:1: Parameter `*ctx->stack.indexes`
      225.   }
      226.   
      227. > void BN_CTX_start(BN_CTX *ctx)
      228.   {
      229.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_sqr.c:147:5: Call
    145.       bn_check_top(rr);
    146.       bn_check_top(tmp);
    147.       BN_CTX_end(ctx);
               ^
    148.       return (ret);
    149.   }

crypto/bn/bn_ctx.c:241:1: Parameter `*ctx->stack.indexes`
      239.   }
      240.   
      241. > void BN_CTX_end(BN_CTX *ctx)
      242.   {
      243.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:247:27: Call
      245.           ctx->err_stack--;
      246.       else {
      247.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                       ^
      248.           /* Does this stack frame have anything to release? */
      249.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:317:1: <Offset trace>
315.   }
316.   
317. > static unsigned int BN_STACK_pop(BN_STACK *st)
318.   {
319.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:317:1: Parameter `st->depth`
        315.   }
        316.   
        317. > static unsigned int BN_STACK_pop(BN_STACK *st)
        318.   {
        319.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:317:1: <Length trace>
315.   }
316.   
317. > static unsigned int BN_STACK_pop(BN_STACK *st)
318.   {
319.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:317:1: Parameter `*st->indexes`
        315.   }
        316.   
        317. > static unsigned int BN_STACK_pop(BN_STACK *st)
        318.   {
        319.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:319:12: Array access: Offset: [-1, +oo] Size: [1, +oo] by call to `BN_mod_mul` 
        317.   static unsigned int BN_STACK_pop(BN_STACK *st)
        318.   {
        319.       return st->indexes[--(st->depth)];
                          ^
        320.   }
        321.   
