crypto/dh/dh_check.c:166: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_is_prime_ex`.
Showing all 49 steps of the trace


crypto/dh/dh_check.c:136:14: Call
134.               *ret |= DH_CHECK_Q_NOT_PRIME;
135.           /* Check p == 1 mod q  i.e. q divides p - 1 */
136.           if (!BN_div(t1, t2, dh->p, dh->q, ctx))
                    ^
137.               goto err;
138.           if (!BN_is_one(t2))

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

crypto/dh/dh_check.c:166:13: Call
164.           if (!BN_rshift1(t1, dh->p))
165.               goto err;
166.           r = BN_is_prime_ex(t1, BN_prime_checks, ctx, NULL);
                   ^
167.           if (r < 0)
168.               goto err;

crypto/bn/bn_prime.c:145:1: Parameter `a->top`
  143.   }
  144.   
  145. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  146.                      BN_GENCB *cb)
  147.   {

crypto/bn/bn_prime.c:148:12: Call
  146.                      BN_GENCB *cb)
  147.   {
  148.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  149.   }
  150.   

crypto/bn/bn_prime.c:151:1: Parameter `a->top`
    149.   }
    150.   
    151. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    152.                               int do_trial_division, BN_GENCB *cb)
    153.   {

crypto/bn/bn_prime.c:161:9: Call
    159.   
    160.       /* Take care of the really small primes 2 & 3 */
    161.       if (BN_is_word(a, 2) || BN_is_word(a, 3))
                   ^
    162.           return 1;
    163.   

crypto/bn/bn_lib.c:855:1: Parameter `a->top`
      853.   }
      854.   
      855. > int BN_is_word(const BIGNUM *a, const BN_ULONG w)
      856.   {
      857.       return BN_abs_is_word(a, w) && (!w || !a->neg);

crypto/bn/bn_lib.c:857:12: Call
      855.   int BN_is_word(const BIGNUM *a, const BN_ULONG w)
      856.   {
      857.       return BN_abs_is_word(a, w) && (!w || !a->neg);
                        ^
      858.   }
      859.   

crypto/bn/bn_lib.c:840:1: Parameter `a->top`
        838.   }
        839.   
        840. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
        841.   {
        842.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

crypto/bn/bn_prime.c:161:29: Call
    159.   
    160.       /* Take care of the really small primes 2 & 3 */
    161.       if (BN_is_word(a, 2) || BN_is_word(a, 3))
                                       ^
    162.           return 1;
    163.   

crypto/bn/bn_lib.c:855:1: Parameter `a->top`
      853.   }
      854.   
      855. > int BN_is_word(const BIGNUM *a, const BN_ULONG w)
      856.   {
      857.       return BN_abs_is_word(a, w) && (!w || !a->neg);

crypto/bn/bn_lib.c:857:12: Call
      855.   int BN_is_word(const BIGNUM *a, const BN_ULONG w)
      856.   {
      857.       return BN_abs_is_word(a, w) && (!w || !a->neg);
                        ^
      858.   }
      859.   

crypto/bn/bn_lib.c:840:1: Parameter `a->top`
        838.   }
        839.   
        840. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
        841.   {
        842.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

crypto/bn/bn_prime.c:165:10: Call
    163.   
    164.       /* Check odd and bigger than 1 */
    165.       if (!BN_is_odd(a) || BN_cmp(a, BN_value_one()) <= 0)
                    ^
    166.           return 0;
    167.   

crypto/bn/bn_lib.c:860:1: Parameter `a->top`
      858.   }
      859.   
      860. > int BN_is_odd(const BIGNUM *a)
      861.   {
      862.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_prime.c:165:26: Call
    163.   
    164.       /* Check odd and bigger than 1 */
    165.       if (!BN_is_odd(a) || BN_cmp(a, BN_value_one()) <= 0)
                                    ^
    166.           return 0;
    167.   

crypto/bn/bn_lib.c:542:1: Parameter `a->top`
      540.   }
      541.   
      542. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
      543.   {
      544.       int i;

crypto/bn/bn_prime.c:198:10: Call
    196.   
    197.       /* compute A1 := a - 1 */
    198.       if (!BN_copy(A1, a) || !BN_sub_word(A1, 1))
                    ^
    199.           goto err;
    200.       /* compute A3 := a - 3 */

crypto/bn/bn_lib.c:285:1: Parameter `b->top`
      283.   }
      284.   
      285. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      286.   {
      287.       bn_check_top(b);

crypto/bn/bn_prime.c:201:10: Call
    199.           goto err;
    200.       /* compute A3 := a - 3 */
    201.       if (!BN_copy(A3, a) || !BN_sub_word(A3, 3))
                    ^
    202.           goto err;
    203.   

crypto/bn/bn_lib.c:285:1: Parameter `b->top`
      283.   }
      284.   
      285. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      286.   {
      287.       bn_check_top(b);

crypto/bn/bn_prime.c:215:10: Call
    213.       if (mont == NULL)
    214.           goto err;
    215.       if (!BN_MONT_CTX_set(mont, a, ctx))
                    ^
    216.           goto err;
    217.   

crypto/bn/bn_mont.c:238:9: Call
      236.       BIGNUM *Ri, *R;
      237.   
      238.       if (BN_is_zero(mod))
                     ^
      239.           return 0;
      240.   

crypto/bn/bn_lib.c:845:1: Parameter `a->top`
        843.   }
        844.   
        845. > int BN_is_zero(const BIGNUM *a)
        846.   {
        847.       return a->top == 0;

crypto/bn/bn_prime.c:223:13: Call
    221.               goto err;
    222.   
    223.           j = witness(check, a, A1, A1_odd, k, ctx, mont);
                       ^
    224.           if (j == -1)
    225.               goto err;

crypto/bn/bn_prime.c:245:1: Parameter `a->top`
      243.   }
      244.   
      245. > static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
      246.                      const BIGNUM *a1_odd, int k, BN_CTX *ctx,
      247.                      BN_MONT_CTX *mont)

crypto/bn/bn_prime.c:249:10: Call
      247.                      BN_MONT_CTX *mont)
      248.   {
      249.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                      ^
      250.           return -1;
      251.       if (BN_is_one(w))

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

crypto/bn/bn_exp.c:310:16: Call
        308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
        309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
        310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                              ^
        311.       }
        312.   

crypto/bn/bn_exp.c:596:1: Parameter `m->top`
          594.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
          595.    */
          596. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
          597.                                 const BIGNUM *m, BN_CTX *ctx,
          598.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:617:10: Call
          615.       bn_check_top(m);
          616.   
          617.       if (!BN_is_odd(m)) {
                          ^
          618.           BNerr(BN_F_BN_MOD_EXP_MONT_CONSTTIME, BN_R_CALLED_WITH_EVEN_MODULUS);
          619.           return 0;

crypto/bn/bn_lib.c:860:1: Parameter `a->top`
            858.   }
            859.   
            860. > int BN_is_odd(const BIGNUM *a)
            861.   {
            862.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_exp.c:755:14: Call
          753.       /* prepare a^1 in Montgomery domain */
          754.       if (a->neg || BN_ucmp(a, m) >= 0) {
          755.           if (!BN_nnmod(&am, a, m, ctx))
                              ^
          756.               goto err;
          757.           if (!BN_to_montgomery(&am, &am, mont, ctx))

crypto/bn/bn_mod.c:13:1: Parameter `d->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:199:31: Call
              197.   
              198.       /* First we normalise the numbers */
              199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                                   ^
              200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
              201.           goto err;

crypto/bn/bn_lib.c:140:9: Assignment
                138.   
                139.       if (BN_is_zero(a))
                140.           return 0;
                               ^
                141.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
                142.   }

crypto/bn/bn_div.c:199:5: Assignment
              197.   
              198.       /* First we normalise the numbers */
              199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                         ^
              200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
              201.           goto err;

crypto/bn/bn_div.c:200:11: Call
              198.       /* First we normalise the numbers */
              199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
              200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                               ^
              201.           goto err;
              202.       sdiv->neg = 0;

crypto/bn/bn_shift.c:83:1: <Offset trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `n`
                81.   }
                82.   
                83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
                84.   {
                85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:5: Assignment
                95.       }
                96.   
                97.       nw = n / BN_BITS2;
                           ^
                98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                99.           return 0;

crypto/bn/bn_shift.c:83:1: <Length trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `*r->d`
                81.   }
                82.   
                83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
                84.   {
                85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:98:9: Call
                96.   
                97.       nw = n / BN_BITS2;
                98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                               ^
                99.           return 0;
                100.       r->neg = a->neg;

crypto/bn/bn_lib.c:941:1: Parameter `*a->d`
                  939.   }
                  940.   
                  941. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
                  942.   {
                  943.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:104:5: Assignment
                102.       rb = BN_BITS2 - lb;
                103.       f = a->d;
                104.       t = r->d;
                           ^
                105.       t[a->top + nw] = 0;
                106.       if (lb == 0)

crypto/bn/bn_shift.c:112:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_is_prime_ex` 
                110.           for (i = a->top - 1; i >= 0; i--) {
                111.               l = f[i];
                112.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                                   ^
                113.               t[nw + i] = (l << lb) & BN_MASK2;
                114.           }
