Common — library colibrilib.qa — module ModE

The Euclidean remainder Real.mod_e (the remainder is in [0, |b|))

6
module ModE
7
use int.Int
8
use real.RealInfix
9
use real.FromInt
10
use real.Abs
11
use real.Truncate
12
use colibrilib.dv.RealFacts
13
use colibrilib.q.Real
14
Valid (148ms) (colibri2 12) (cvc5 2) (split_vc) (depth 1)
15
let ghost
mod_e_facts
(a b:real) : unit
16
requires { b <> 0.0 }
17
ensures { 0.0 <=. mod_e a b /\ mod_e a b <. abs b }
18
ensures { mod_e a b = a -. from_int (div_e a b) *. b }
19
= {proof…} let d = a /. b in
20
assert { a = d *. b };
21
if b >. 0.0 then begin
22
let fl = from_int (Truncate.floor d) in
23
assert { fl <=. d <. fl +. 1.0 };
24
assert { mod_e a b = b *. (d -. fl) };
25
mul_nonneg b (d -. fl);
26
mul_pos b (1.0 -. (d -. fl));
27
assert { abs b = b }
28
end else begin
29
let c = from_int (Truncate.ceil d) in
30
assert { c -. 1.0 <. d <=. c };
31
assert { mod_e a b = (-. b) *. (c -. d) };
32
mul_nonneg (-. b) (c -. d);
33
mul_pos (-. b) (1.0 -. (c -. d));
34
assert { abs b = -. b }
35
end {qed}
36
end