jyao15 / g-cln Goto Github PK

Running: cohencu
cohencu loop 1
Seed: 0
100%|██████████████████████████████████████| 5000/5000 [00:13<00:00, 367.42it/s]
100%|███████████████████████████████████████████| 10/10 [00:01<00:00,  5.03it/s]
Performing soundness checks (bar represents max possible checks, will finish early)
100%|███████████████████████████████████████████| 15/15 [00:05<00:00,  2.98it/s]
 40%|█████████████████▏                         | 6/15 [00:00<00:00, 184.08it/s]
Runtime: 20.7s
Learned Invariant:
And(a >= 0,
    z >= 6,
    a + -1*n >= -1,
    6*n + -1*z == -6,
    18*n*n + 12*n + -6*y + z == 0,
    n*n*n == x)
Documented Invariant:
And(z == 6 + 6*n,
    y == 1 + 3*n*n + 3*n,
    x == n*n*n,
    n <= 1 + a)
Correct Invariant Learned?: TRUE
Running: cohendiv
cohendiv loop 1
Seed: 0
100%|██████████████████████████████████████| 5000/5000 [00:08<00:00, 578.14it/s]
Performing soundness checks (bar represents max possible checks, will finish early)
100%|██████████████████████████████████████████| 12/12 [00:00<00:00, 503.15it/s]
 23%|█████████▉                                 | 3/13 [00:00<00:00, 164.34it/s]
Runtime: 8.8s
Learned Invariant:
And(x >= 1,
    y >= 1,
    q >= 0,
    r >= 0,
    b >= 0,
    q*y + r + -1*x == 0,
    a*y == b)
Documented Invariant:
And(x == q*y + r, r >= 0, x >= 1, y >= 1)
Correct Invariant Learned?: TRUE
cohendiv loop 2
Seed: 0
100%|██████████████████████████████████████| 5000/5000 [00:09<00:00, 554.94it/s]
100%|███████████████████████████████████████████| 15/15 [00:02<00:00,  5.93it/s]
Performing soundness checks (bar represents max possible checks, will finish early)
100%|███████████████████████████████████████████| 33/33 [00:05<00:00,  6.49it/s]
 15%|██████▋                                     | 5/33 [00:00<00:00, 82.17it/s]