3
/*@ predicate my_killing_prop(double uc, double up, int n) */
7
/*@ requires 2 <= N <= 2^^26 &&
8
@ \exact(u0)==u0 && \exact(u1)==u1 &&
9
@ \forall int k; 0 <= k <= N => |u0+k*(u1-u0)| <= 1
10
@ ensures \exact(\result)==u0+N*(u1-u0) &&
11
@ \round_error(\result) <= (N)*(N+1)/2.*2^^(-53)
15
double comput_seq(double u0, double u1, int N) {
17
double uprev, ucur,tmp;
21
/*@ invariant 2 <= i && i <= N+1 &&
22
@ \exact(ucur) ==u0+(i-1)*(u1-u0) &&
23
@ \exact(uprev)==u0+(i-2)*(u1-u0) &&
24
@ my_killing_prop(ucur,uprev,i-2)
26
for (i=2; i<=N; i++) {
28
/*@ assert tmp==2*ucur */