File: gcd-body3.lisp

package info (click to toggle)
acl2 8.6%2Bdfsg-2
  • links: PTS
  • area: main
  • in suites: trixie
  • size: 1,111,420 kB
  • sloc: lisp: 17,818,294; java: 125,359; python: 28,122; javascript: 23,458; cpp: 18,851; ansic: 11,569; perl: 7,678; xml: 5,591; sh: 3,976; makefile: 3,833; ruby: 2,633; yacc: 1,126; ml: 763; awk: 295; csh: 233; lex: 197; php: 178; tcl: 49; asm: 23; haskell: 17
file content (874 lines) | stat: -rw-r--r-- 32,327 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
;; Copyright (C) 2018, Regents of the University of Texas
;; Written by Cuong Chau
;; License: A 3-clause BSD license.  See the LICENSE file distributed with
;; ACL2.

;; Cuong Chau <ckcuong@cs.utexas.edu>
;; May 2019

(in-package "ADE")

(include-book "../vector-module")
(include-book "../comparators/v-less")
(include-book "../serial-adder/serial-sub")

(local (include-book "arithmetic-3/top" :dir :system))

(local (in-theory (disable nth)))

;; ======================================================================

;;; Table of Contents:
;;;
;;; 1. DE Module Generator of GCD-BODY3
;;; 2. Multi-Step State Lemma
;;; 3. Single-Step-Update Property
;;; 4. Relationship Between the Input and Output Sequences

;; ======================================================================

;; 1. DE Module Generator of GCD-BODY3
;;
;; GCD-BODY3 performs the GCD operation in one iteration.  It is constructed
;; using the self-timed serial subtractor SERIAL-SUB.

(defconst *gcd-body3$prim-go-num* 2)
(defconst *gcd-body3$go-num* (+ *gcd-body3$prim-go-num*
                                *serial-sub$go-num*))

(defun gcd-body3$data-ins-len (data-size)
  (declare (xargs :guard (natp data-size)))
  (+ 2 (* 2 (mbe :logic (nfix data-size)
                 :exec  data-size))))

(defun gcd-body3$ins-len (data-size)
  (declare (xargs :guard (natp data-size)))
  (+ (gcd-body3$data-ins-len data-size)
     *gcd-body3$go-num*))

(module-generator
 gcd-body3* (data-size)
 (si 'gcd-body3 data-size)
 (list* 'full-in 'empty-out-
        (append (sis 'data-in 0 (* 2 data-size))
                (sis 'go 0 *gcd-body3$go-num*)))
 (list* 'in-act 'out-act
        (sis 'data-out 0 (* 2 data-size)))
 '(l0 l1 l2 sub)
 (list
  ;; LINKS
  ;; L0
  (list 'l0
        (list* 'l0-status (sis 'd0-out 0 (* 2 data-size)))
        (si 'link (* 2 data-size))
        (list* 'in-act 'sub-in-act (sis 'd0-in 0 (* 2 data-size))))

  ;; L1
  (list 'l1
        (list* 'l1-status (sis 'd1-out 0 data-size))
        (si 'link data-size)
        (list* 'in-act 'out-act (sis 'd1-in 0 data-size)))

  ;; L2
  (list 'l2
        (list* 'l2-status (sis 'd2-out 0 data-size))
        (si 'link data-size)
        (list* 'sub-out-act 'out-act (sis 'd2-in 0 data-size)))

  ;; JOINTS
  ;; In
  '(g0 (ready-in-) b-or (l0-status l1-status))
  (list 'in-cntl
        '(in-act)
        'joint-cntl
        (list 'full-in 'ready-in- (si 'go 0)))
  (list 'in-op0
        '(a<b)
        (si 'v-< data-size)
        (append (rev (sis 'data-in 0 data-size))
                (rev (sis 'data-in data-size data-size))))
  (list 'in-op1
        (sis 'd0-in 0 (* 2 data-size))
        (si 'tv-if (tree-number (make-tree (* 2 data-size))))
        (cons 'a<b
              (append (append (sis 'data-in data-size data-size)
                              (sis 'data-in 0 data-size))
                      (sis 'data-in 0 (* 2 data-size)))))
  (list 'in-op2
        (sis 'd1-in 0 data-size)
        (si 'tv-if (tree-number (make-tree data-size)))
        (cons 'a<b
              (append (sis 'data-in 0 data-size)
                      (sis 'data-in data-size data-size))))

  ;; Subtractor
  (list 'sub
        (list* 'sub-in-act 'sub-out-act
               (sis 'd2-in 0 data-size))
        (si 'serial-sub data-size)
        (list* 'l0-status 'l2-status
               (append (sis 'd0-out 0 data-size)
                       (sis 'd0-out data-size data-size)
                       (sis 'go 2 *serial-sub$go-num*))))

  ;; Out
  '(g1 (ready-out) b-and (l1-status l2-status))
  (list 'out-cntl
        '(out-act)
        'joint-cntl
        (list 'ready-out 'empty-out- (si 'go 1)))
  (list 'out-op
        (sis 'data-out 0 (* 2 data-size))
        (si 'v-wire (* 2 data-size))
        (append (sis 'd2-out 0 data-size)
                (sis 'd1-out 0 data-size))))
 (declare (xargs :guard (natp data-size))))

(make-event
 `(progn
    ,@(state-accessors-gen 'gcd-body3 '(l0 l1 l2 sub) 0)))

;; DE netlist generator.  A generated netlist will contain an instance of
;; GCD-BODY3.

(defund gcd-body3$netlist (data-size cnt-size)
  (declare (xargs :guard (and (posp data-size)
                              (natp cnt-size)
                              (<= 3 cnt-size))))
  (cons (gcd-body3* data-size)
        (union$ (link$netlist (* 2 data-size))
                (tv-if$netlist (make-tree (* 2 data-size)))
                (v-wire$netlist (* 2 data-size))
                (v-<$netlist data-size)
                (serial-sub$netlist data-size cnt-size)
                :test 'equal)))

;; Recognizer for GCD-BODY3

(defund gcd-body3& (netlist data-size cnt-size)
  (declare (xargs :guard (and (alistp netlist)
                              (posp data-size)
                              (natp cnt-size)
                              (<= 3 cnt-size))))
  (b* ((subnetlist (delete-to-eq (si 'gcd-body3 data-size) netlist)))
    (and (equal (assoc (si 'gcd-body3 data-size) netlist)
                (gcd-body3* data-size))
         (link& subnetlist data-size)
         (link& subnetlist (* 2 data-size))
         (joint-cntl& subnetlist)
         (tv-if& subnetlist (make-tree data-size))
         (tv-if& subnetlist (make-tree (* 2 data-size)))
         (v-wire& subnetlist (* 2 data-size))
         (v-<& subnetlist data-size)
         (serial-sub& subnetlist data-size cnt-size))))

;; Sanity check

(local
 (defthmd check-gcd-body3$netlist-64-7
   (and (net-syntax-okp (gcd-body3$netlist 64 7))
        (net-arity-okp (gcd-body3$netlist 64 7))
        (gcd-body3& (gcd-body3$netlist 64 7) 64 7))))

;; Constraints on the state of GCD-BODY3

(defund gcd-body3$st-format (st data-size cnt-size)
  (b* ((l0 (nth *gcd-body3$l0* st))
       (l1 (nth *gcd-body3$l1* st))
       (l2 (nth *gcd-body3$l2* st))
       (sub (nth *gcd-body3$sub* st)))
    (and (link$st-format l0 (* 2 data-size))
         (link$st-format l1 data-size)
         (link$st-format l2 data-size)
         (serial-sub$st-format sub data-size cnt-size))))

(defthm gcd-body3$st-format=>constraint
  (implies (gcd-body3$st-format st data-size cnt-size)
           (and (posp data-size)
                (natp cnt-size)
                (<= 4 cnt-size)))
  :hints (("Goal" :in-theory (enable gcd-body3$st-format)))
  :rule-classes :forward-chaining)

(defund gcd-body3$valid-st (st data-size cnt-size)
  (b* ((l0 (nth *gcd-body3$l0* st))
       (l1 (nth *gcd-body3$l1* st))
       (l2 (nth *gcd-body3$l2* st))
       (sub (nth *gcd-body3$sub* st)))
    (and (link$valid-st l0 (* 2 data-size))
         (link$valid-st l1 data-size)
         (link$valid-st l2 data-size)
         (serial-sub$valid-st sub data-size cnt-size))))

(defthmd gcd-body3$valid-st=>constraint
  (implies (gcd-body3$valid-st st data-size cnt-size)
           (and (posp data-size)
                (natp cnt-size)
                (<= 4 cnt-size)))
  :hints (("Goal" :in-theory (enable serial-sub$valid-st=>constraint
                                     gcd-body3$valid-st)))
  :rule-classes :forward-chaining)

(defthmd gcd-body3$valid-st=>st-format
  (implies (gcd-body3$valid-st st data-size cnt-size)
           (gcd-body3$st-format st data-size cnt-size))
  :hints (("Goal" :in-theory (e/d (serial-sub$valid-st=>st-format
                                   gcd-body3$st-format
                                   gcd-body3$valid-st)
                                  ()))))

;; Extract the input and output signals for GCD-BODY3

(progn
  ;; Extract the input data

  (defun gcd-body3$data-in (inputs data-size)
    (declare (xargs :guard (and (true-listp inputs)
                                (natp data-size))))
    (take (* 2 (mbe :logic (nfix data-size)
                    :exec  data-size))
          (nthcdr 2 inputs)))

  (defthm len-gcd-body3$data-in
    (equal (len (gcd-body3$data-in inputs data-size))
           (* 2 (nfix data-size))))

  (in-theory (disable gcd-body3$data-in))

  ;; Extract the "a<b" signal

  (defund gcd-body3$a<b (inputs data-size)
    (b* ((data-in (gcd-body3$data-in inputs data-size)))
      (fv-< nil t
            (rev (take data-size data-in))
            (rev (nthcdr data-size data-in)))))

  ;; Extract the inputs for the SUB joint

  (defund gcd-body3$sub-inputs (inputs st data-size)
    (b* ((go-signals (nthcdr (gcd-body3$data-ins-len data-size) inputs))
         (sub-go-signals (take *serial-sub$go-num*
                               (nthcdr *gcd-body3$prim-go-num*
                                       go-signals)))

         (l0 (nth *gcd-body3$l0* st))
         (l0.s (nth *link$s* l0))
         (l0.d (nth *link$d* l0))
         (l2 (nth *gcd-body3$l2* st))
         (l2.s (nth *link$s* l2)))
      (list* (f-buf (car l0.s)) (f-buf (car l2.s))
             (append (v-threefix (take data-size (strip-cars l0.d)))
                     (v-threefix (nthcdr data-size (strip-cars l0.d)))
                     sub-go-signals))))

  ;; Extract the "in-act" signal

  (defund gcd-body3$in-act (inputs st data-size)
    (b* ((full-in (nth 0 inputs))
         (go-signals (nthcdr (gcd-body3$data-ins-len data-size) inputs))
         (go-in (nth 0 go-signals))

         (l0 (nth *gcd-body3$l0* st))
         (l0.s (nth *link$s* l0))
         (l1 (nth *gcd-body3$l1* st))
         (l1.s (nth *link$s* l1))

         (ready-in- (f-or (car l0.s) (car l1.s))))
      (joint-act full-in ready-in- go-in)))

  (defthm gcd-body3$in-act-inactive
    (implies (not (nth 0 inputs))
             (not (gcd-body3$in-act inputs st data-size)))
    :hints (("Goal" :in-theory (enable gcd-body3$in-act))))

  ;; Extract the "out-act" signal

  (defund gcd-body3$out-act (inputs st data-size)
    (b* ((empty-out- (nth 1 inputs))
         (go-signals (nthcdr (gcd-body3$data-ins-len data-size) inputs))
         (go-out (nth 1 go-signals))

         (l1 (nth *gcd-body3$l1* st))
         (l1.s (nth *link$s* l1))
         (l2 (nth *gcd-body3$l2* st))
         (l2.s (nth *link$s* l2))

         (ready-out (f-and (car l1.s) (car l2.s))))
      (joint-act ready-out empty-out- go-out)))

  (defthm gcd-body3$out-act-inactive
    (implies (equal (nth 1 inputs) t)
             (not (gcd-body3$out-act inputs st data-size)))
    :hints (("Goal" :in-theory (enable gcd-body3$out-act))))

  (defthm gcd-body3$in-out-acts-mutually-exclusive
    (implies (and (gcd-body3$valid-st st data-size cnt-size)
                  (gcd-body3$in-act inputs st data-size))
             (not (gcd-body3$out-act inputs st data-size)))
    :hints (("Goal" :in-theory (enable gcd-body3$valid-st
                                       gcd-body3$in-act
                                       gcd-body3$out-act))))

  ;; Extract the output data

  (defund gcd-body3$data-out (st)
    (b* ((l1 (nth *gcd-body3$l1* st))
         (l1.d (nth *link$d* l1))
         (l2 (nth *gcd-body3$l2* st))
         (l2.d (nth *link$d* l2)))
      (append (v-threefix (strip-cars l2.d))
              (v-threefix (strip-cars l1.d)))))

  (defthm len-gcd-body3$data-out-1
    (implies (gcd-body3$st-format st data-size cnt-size)
             (equal (len (gcd-body3$data-out st))
                    (* 2 data-size)))
    :hints (("Goal" :in-theory (enable gcd-body3$st-format
                                       gcd-body3$data-out))))

  (defthm len-gcd-body3$data-out-2
    (implies (gcd-body3$valid-st st data-size cnt-size)
             (equal (len (gcd-body3$data-out st))
                    (* 2 data-size)))
    :hints (("Goal" :in-theory (enable gcd-body3$valid-st
                                       gcd-body3$data-out))))

  (defthm bvp-gcd-body3$data-out
    (implies (and (gcd-body3$valid-st st data-size cnt-size)
                  (gcd-body3$out-act inputs st data-size))
             (bvp (gcd-body3$data-out st)))
    :hints (("Goal" :in-theory (enable gcd-body3$valid-st
                                       gcd-body3$out-act
                                       gcd-body3$data-out))))

  (defun gcd-body3$outputs (inputs st data-size)
    (list* (gcd-body3$in-act inputs st data-size)
           (gcd-body3$out-act inputs st data-size)
           (gcd-body3$data-out st)))
  )

;; The value lemma for GCD-BODY3

(defthm gcd-body3$value
  (b* ((inputs (list* full-in empty-out-
                      (append data-in go-signals))))
    (implies (and (gcd-body3& netlist data-size cnt-size)
                  (true-listp data-in)
                  (equal (len data-in) (* 2 data-size))
                  (true-listp go-signals)
                  (equal (len go-signals) *gcd-body3$go-num*)
                  (gcd-body3$st-format st data-size cnt-size))
             (equal (se (si 'gcd-body3 data-size) inputs st netlist)
                    (gcd-body3$outputs inputs st data-size))))
  :hints (("Goal"
           :do-not-induct t
           :expand (:free (inputs data-size)
                          (se (si 'gcd-body3 data-size)
                              inputs st netlist))
           :in-theory (e/d (de-rules
                            gcd-body3&
                            gcd-body3*$destructure
                            gcd-body3$st-format
                            gcd-body3$in-act
                            gcd-body3$out-act
                            gcd-body3$data-out)
                           (de-module-disabled-rules)))))

;; This function specifies the next state of GCD-BODY3.

(defun gcd-body3$step (inputs st data-size cnt-size)
  (b* ((data-in (gcd-body3$data-in inputs data-size))

       (l0 (nth *gcd-body3$l0* st))
       (l1 (nth *gcd-body3$l1* st))
       (l2 (nth *gcd-body3$l2* st))
       (sub (nth *gcd-body3$sub* st))

       (in-act (gcd-body3$in-act inputs st data-size))
       (out-act (gcd-body3$out-act inputs st data-size))
       (sub-inputs (gcd-body3$sub-inputs inputs st data-size))
       (sub-in-act (serial-sub$in-act sub-inputs sub data-size))
       (sub-out-act (serial-sub$out-act sub-inputs sub data-size))

       (a<b (gcd-body3$a<b inputs data-size))
       (d0-in (fv-if a<b
                     (append (nthcdr data-size data-in)
                             (take data-size data-in))
                     data-in))
       (d1-in (fv-if a<b
                     (take data-size data-in)
                     (nthcdr data-size data-in)))
       (d2-in (serial-sub$data-out sub))

       (l0-inputs (list* in-act sub-in-act d0-in))
       (l1-inputs (list* in-act out-act d1-in))
       (l2-inputs (list* sub-out-act out-act d2-in)))
    (list
     ;; L0
     (link$step l0-inputs l0 (* 2 data-size))
     ;; L1
     (link$step l1-inputs l1 data-size)
     ;; L2
     (link$step l2-inputs l2 data-size)
     ;; Joint SUB
     (serial-sub$step sub-inputs sub data-size cnt-size))))

;; The state lemma for GCD-BODY3

(defthm gcd-body3$state
  (b* ((inputs (list* full-in empty-out-
                      (append data-in go-signals))))
    (implies (and (gcd-body3& netlist data-size cnt-size)
                  (true-listp data-in)
                  (equal (len data-in) (* 2 data-size))
                  (true-listp go-signals)
                  (equal (len go-signals) *gcd-body3$go-num*)
                  (gcd-body3$st-format st data-size cnt-size))
             (equal (de (si 'gcd-body3 data-size) inputs st netlist)
                    (gcd-body3$step inputs st data-size cnt-size))))
  :hints (("Goal"
           :do-not-induct t
           :expand (:free (inputs data-size)
                          (de (si 'gcd-body3 data-size)
                              inputs st netlist))
           :in-theory (e/d (de-rules
                            gcd-body3&
                            gcd-body3*$destructure
                            gcd-body3$st-format
                            gcd-body3$data-in
                            gcd-body3$a<b
                            gcd-body3$sub-inputs
                            gcd-body3$in-act
                            gcd-body3$out-act)
                           (associativity-of-append
                            append-take-nthcdr
                            de-module-disabled-rules)))))

(in-theory (disable gcd-body3$step))

;; ======================================================================

;; 2. Multi-Step State Lemma

;; Conditions on the inputs

(defund gcd-body3$input-format (inputs data-size)
  (declare (xargs :guard (and (true-listp inputs)
                              (natp data-size))))
  (b* ((full-in    (nth 0 inputs))
       (empty-out- (nth 1 inputs))
       (data-in    (gcd-body3$data-in inputs data-size))
       (go-signals (nthcdr (gcd-body3$data-ins-len data-size) inputs)))
    (and
     (booleanp full-in)
     (booleanp empty-out-)
     (or (not full-in)
         (bvp data-in))
     (true-listp go-signals)
     (= (len go-signals) *gcd-body3$go-num*)
     (equal inputs
            (list* full-in empty-out-
                   (append data-in go-signals))))))

(local
 (defthm gcd-body3$input-format=>sub$input-format
   (implies (and (gcd-body3$input-format inputs data-size)
                 (gcd-body3$valid-st st data-size cnt-size))
            (serial-sub$input-format
             (gcd-body3$sub-inputs inputs st data-size)
             data-size))
   :hints (("Goal"
            :in-theory (e/d (serial-sub$input-format
                             serial-sub$data0-in
                             serial-sub$data1-in
                             gcd-body3$input-format
                             gcd-body3$valid-st
                             gcd-body3$sub-inputs)
                            ())))))

(defthm booleanp-gcd-body3$in-act
  (implies (and (gcd-body3$input-format inputs data-size)
                (gcd-body3$valid-st st data-size cnt-size))
           (booleanp (gcd-body3$in-act inputs st data-size)))
  :hints (("Goal"
           :in-theory (e/d (gcd-body3$input-format
                            gcd-body3$valid-st
                            gcd-body3$in-act)
                           ())))
  :rule-classes (:rewrite :type-prescription))

(defthm booleanp-gcd-body3$out-act
  (implies (and (gcd-body3$input-format inputs data-size)
                (gcd-body3$valid-st st data-size cnt-size))
           (booleanp (gcd-body3$out-act inputs st data-size)))
  :hints (("Goal"
           :in-theory (e/d (gcd-body3$input-format
                            gcd-body3$valid-st
                            gcd-body3$out-act)
                           ())))
  :rule-classes (:rewrite :type-prescription))

(simulate-lemma gcd-body3 :sizes (data-size cnt-size))

;; ======================================================================

;; 3. Single-Step-Update Property

;; Specify the functionality of GCD-BODY3

(defund gcd-body3$op (x)
  (b* ((data-size (/ (len x) 2))
       (a (take data-size x))
       (b (nthcdr data-size x))
       (a<b (v-< nil t (rev a) (rev b))))
    (cond
     ((or (atom x)
          (zp data-size)
          (not (bvp x)))
      x)
     (t (v-if a<b
              (append (serial-sub$op t b a) a)
              (append (serial-sub$op t a b) b))))))

;; The operation of GCD-BODY3 over a data sequence

(defun gcd-body3$op-map (x)
  (if (atom x)
      nil
    (cons (gcd-body3$op (car x))
          (gcd-body3$op-map (cdr x)))))

(defthm gcd-body3$op-map-of-append
  (equal (gcd-body3$op-map (append x y))
         (append (gcd-body3$op-map x)
                 (gcd-body3$op-map y))))

;; The extraction function for GCD-BODY3 that extracts the future output
;; sequence from the current state.

(defund gcd-body3$extract (st data-size)
  (b* ((l0 (nth *gcd-body3$l0* st))
       (l0.s (nth *link$s* l0))
       (l0.d (nth *link$d* l0))
       (l1 (nth *gcd-body3$l1* st))
       (l1.s (nth *link$s* l1))
       (l1.d (nth *link$d* l1))
       (l2 (nth *gcd-body3$l2* st))
       (l2.s (nth *link$s* l2))
       (l2.d (nth *link$d* l2))
       (sub (nth *gcd-body3$sub* st)))
    (if (emptyp l1.s)
        nil
      (list
       (append
        (cond ((fullp l0.s)
               (serial-sub$op t
                              (take data-size (strip-cars l0.d))
                              (nthcdr data-size (strip-cars l0.d))))
              ((fullp l2.s)
               (strip-cars l2.d))
              (t (car (serial-sub$extract sub data-size))))
        (strip-cars l1.d))))))

(defthm gcd-body3$extract-not-empty
  (implies (and (gcd-body3$out-act inputs st data-size)
                (gcd-body3$valid-st st data-size cnt-size))
           (< 0 (len (gcd-body3$extract st data-size))))
  :hints (("Goal"
           :in-theory (e/d (gcd-body3$valid-st
                            gcd-body3$extract
                            gcd-body3$out-act)
                           ())))
  :rule-classes :linear)

;; Specify and prove a state invariant

(progn
  (defund gcd-body3$inv (st data-size)
    (b* ((l0 (nth *gcd-body3$l0* st))
         (l1 (nth *gcd-body3$l1* st))
         (l2 (nth *gcd-body3$l2* st))
         (sub (nth *gcd-body3$sub* st))

         (len1 (len (append
                     (extract-valid-data (list l0 l2))
                     (serial-sub$extract sub data-size))))
         (len2 (len (extract-valid-data (list l1)))))
      (and (equal len1 len2)
           (serial-sub$inv sub data-size))))

  (local
   (defthm gcd-body3$sub-in-act-inactive
     (b* ((l0 (nth *gcd-body3$l0* st))
          (l0.s (nth *link$s* l0))
          (sub (nth *gcd-body3$sub* st))
          (sub-inputs (gcd-body3$sub-inputs inputs st data-size)))
       (implies (emptyp l0.s)
                (not (serial-sub$in-act sub-inputs
                                        sub
                                        data-size))))
     :hints (("Goal" :in-theory (enable gcd-body3$sub-inputs)))))

  (defthm gcd-body3$inv-preserved
    (implies (and (gcd-body3$input-format inputs data-size)
                  (gcd-body3$valid-st st data-size cnt-size)
                  (gcd-body3$inv st data-size))
             (gcd-body3$inv
              (gcd-body3$step inputs st data-size cnt-size)
              data-size))
    :hints (("Goal"
             :use gcd-body3$input-format=>sub$input-format
             :in-theory (e/d (f-sr
                              serial-sub$extracted-step
                              gcd-body3$valid-st
                              gcd-body3$inv
                              gcd-body3$step
                              gcd-body3$in-act
                              gcd-body3$out-act)
                             (gcd-body3$input-format=>sub$input-format)))))
  )

;; The extracted next-state function for GCD-BODY3.  Note that this
;; function avoids exploring the internal computation of GCD-BODY3.

(defund gcd-body3$extracted-step (inputs st data-size)
  (b* ((data (gcd-body3$op (gcd-body3$data-in inputs data-size)))
       (extracted-st (gcd-body3$extract st data-size))
       (n (1- (len extracted-st))))
    (cond
     ((equal (gcd-body3$out-act inputs st data-size) t)
      (take n extracted-st))
     ((equal (gcd-body3$in-act inputs st data-size) t)
      (cons data extracted-st))
     (t extracted-st))))

(local
 (defthm gcd-body3$input-format-lemma-1
   (implies (gcd-body3$input-format inputs data-size)
            (booleanp (nth 0 inputs)))
   :hints (("Goal" :in-theory (enable gcd-body3$input-format)))
   :rule-classes (:rewrite :type-prescription)))

(local
 (defthm gcd-body3$input-format-lemma-2
   (implies (gcd-body3$input-format inputs data-size)
            (booleanp (nth 1 inputs)))
   :hints (("Goal" :in-theory (enable gcd-body3$input-format)))
   :rule-classes (:rewrite :type-prescription)))

(local
 (defthm gcd-body3$input-format-lemma-3
   (implies (and (gcd-body3$input-format inputs data-size)
                 (nth 0 inputs))
            (bvp (gcd-body3$data-in inputs data-size)))
   :hints (("Goal" :in-theory (enable gcd-body3$input-format)))))

;; The single-step-update property

(encapsulate
  ()

  (local
   (defthm gcd-body3$extracted-step-correct-aux-1
     (b* ((sub-inputs (gcd-body3$sub-inputs inputs st data-size))
          (l0 (nth *gcd-body3$l0* st))
          (l0.d (nth *link$d* l0)))
       (equal (serial-sub$data0-in sub-inputs data-size)
              (v-threefix (take data-size (strip-cars l0.d)))))
     :hints (("Goal" :in-theory (enable serial-sub$data0-in
                                        gcd-body3$sub-inputs)))))

  (local
   (defthm gcd-body3$extracted-step-correct-aux-2
     (b* ((sub-inputs (gcd-body3$sub-inputs inputs st data-size))
          (l0 (nth *gcd-body3$l0* st))
          (l0.d (nth *link$d* l0)))
       (implies (and (equal (len l0.d) (* 2 data-size))
                     (integerp data-size))
                (equal (serial-sub$data1-in sub-inputs data-size)
                       (v-threefix (nthcdr data-size (strip-cars l0.d))))))
     :hints (("Goal" :in-theory (enable serial-sub$data1-in
                                        gcd-body3$sub-inputs)))))

  (local
   (defthm car-of-serial-sub$extract-lemma
     (implies (and (equal (len (serial-sub$extract st data-size))
                          1)
                   (serial-sub$valid-st st data-size cnt-size)
                   (serial-sub$inv st data-size)
                   (serial-sub$out-act inputs st data-size))
              (equal (car (serial-sub$extract st data-size))
                     (serial-sub$data-out st)))
     :hints (("Goal"
              :do-not-induct t
              :in-theory (e/d (serial-sub$valid-st
                               serial-sub$inv
                               serial-sub$extract
                               serial-sub$out-act
                               serial-sub$data-out)
                              (acl2::normalize-terms-such-as-a/a+b-+-b/a+b
                               acl2::prefer-positive-addends-<
                               acl2::simplify-products-gather-exponents-<
                               acl2::len-when-prefixp
                               acl2::take-when-prefixp
                               take
                               not
                               default-car
                               default-cdr
                               true-listp
                               bv-is-true-list))))))

  (defthm gcd-body3$extracted-step-correct
    (b* ((next-st (gcd-body3$step inputs st data-size cnt-size)))
      (implies (and (gcd-body3$input-format inputs data-size)
                    (gcd-body3$valid-st st data-size cnt-size)
                    (gcd-body3$inv st data-size))
               (equal (gcd-body3$extract next-st data-size)
                      (gcd-body3$extracted-step inputs st data-size))))
    :hints (("Goal"
             :use gcd-body3$input-format=>sub$input-format
             :in-theory (e/d (joint-act
                              pos-len=>cons
                              fv-if-rewrite
                              serial-sub$valid-st=>constraint
                              serial-sub$extracted-step
                              gcd-body3$extracted-step
                              gcd-body3$valid-st
                              gcd-body3$inv
                              gcd-body3$step
                              gcd-body3$a<b
                              gcd-body3$in-act
                              gcd-body3$out-act
                              gcd-body3$extract
                              gcd-body3$op)
                             (gcd-body3$input-format=>sub$input-format)))))
  )

;; ======================================================================

;; 4. Relationship Between the Input and Output Sequences

;; Prove that gcd-body3$valid-st is an invariant.

(encapsulate
  ()

  (local
   (defthm gcd-body3$sub-out-act-inactive
     (b* ((l2 (nth *gcd-body3$l2* st))
          (l2.s (nth *link$s* l2))
          (sub (nth *gcd-body3$sub* st))
          (sub-inputs (gcd-body3$sub-inputs inputs st data-size)))
       (implies (fullp l2.s)
                (not (serial-sub$out-act sub-inputs
                                         sub
                                         data-size))))
     :hints (("Goal" :in-theory (enable gcd-body3$sub-inputs)))))

  (defthm gcd-body3$valid-st-preserved
    (implies (and (gcd-body3$input-format inputs data-size)
                  (gcd-body3$valid-st st data-size cnt-size))
             (gcd-body3$valid-st
              (gcd-body3$step inputs st data-size cnt-size)
              data-size
              cnt-size))
    :hints (("Goal"
             :use gcd-body3$input-format=>sub$input-format
             :in-theory (e/d (f-sr
                              joint-act
                              serial-sub$valid-st=>constraint
                              gcd-body3$valid-st
                              gcd-body3$step
                              gcd-body3$a<b
                              gcd-body3$in-act
                              gcd-body3$out-act)
                             (gcd-body3$input-format=>sub$input-format
                              if*)))))
  )

(defthm gcd-body3$extract-lemma
  (implies (and (gcd-body3$valid-st st data-size cnt-size)
                (gcd-body3$inv st data-size)
                (gcd-body3$out-act inputs st data-size))
           (equal (list (gcd-body3$data-out st))
                  (nthcdr (1- (len (gcd-body3$extract st data-size)))
                          (gcd-body3$extract st data-size))))
  :hints (("Goal"
           :do-not-induct t
           :in-theory (e/d (len-0-is-atom
                            gcd-body3$valid-st
                            gcd-body3$inv
                            gcd-body3$extract
                            gcd-body3$out-act
                            gcd-body3$data-out)
                           ()))))

;; Extract the accepted input sequence

(seq-gen gcd-body3 in in-act 0
         (gcd-body3$data-in inputs data-size)
         :sizes (data-size cnt-size))

;; Extract the valid output sequence

(seq-gen gcd-body3 out out-act 1
         (gcd-body3$data-out st)
         :netlist-data (nthcdr 2 outputs)
         :sizes (data-size cnt-size))

;; The multi-step input-output relationship

(encapsulate
  ()

  (local
   (defthm gcd-body3$dataflow-correct-aux
     (implies (equal (append x y1)
                     (append (gcd-body3$op-map seq) y2))
              (equal (append x y1 z)
                     (append (gcd-body3$op-map seq)
                             y2 z)))
     :hints (("Goal" :in-theory (e/d (left-associativity-of-append)
                                     (associativity-of-append))))))

  (defthmd gcd-body3$dataflow-correct
    (b* ((extracted-st (gcd-body3$extract st data-size))
         (final-st (gcd-body3$run
                    inputs-seq st data-size cnt-size n))
         (final-extracted-st (gcd-body3$extract final-st data-size)))
      (implies
       (and (gcd-body3$input-format-n inputs-seq data-size n)
            (gcd-body3$valid-st st data-size cnt-size)
            (gcd-body3$inv st data-size))
       (equal (append final-extracted-st
                      (gcd-body3$out-seq
                       inputs-seq st data-size cnt-size n))
              (append (gcd-body3$op-map
                       (gcd-body3$in-seq
                        inputs-seq st data-size cnt-size n))
                      extracted-st))))
    :hints (("Goal"
             :in-theory (enable gcd-body3$extracted-step))))

  (defthmd gcd-body3$functionally-correct
    (b* ((extracted-st (gcd-body3$extract st data-size))
         (final-st (de-n (si 'gcd-body3 data-size)
                         inputs-seq st netlist n))
         (final-extracted-st (gcd-body3$extract final-st data-size)))
      (implies
       (and (gcd-body3& netlist data-size cnt-size)
            (gcd-body3$input-format-n inputs-seq data-size n)
            (gcd-body3$valid-st st data-size cnt-size)
            (gcd-body3$inv st data-size))
       (equal (append final-extracted-st
                      (gcd-body3$out-seq-netlist
                       inputs-seq st netlist data-size n))
              (append (gcd-body3$op-map
                       (gcd-body3$in-seq-netlist
                        inputs-seq st netlist data-size n))
                      extracted-st))))
    :hints (("Goal"
             :use gcd-body3$dataflow-correct
             :in-theory (enable gcd-body3$valid-st=>st-format
                                gcd-body3$de-n))))
  )